A binary search algorithm for the generalized maximum balanced flow problem

Search this article

Description

We consider the generalized maximum balanced flow problem (GMBF), i.e., the problem of finding a generalized maximum flow in a network such that each arc-flow value is bounded by a given fixed proportion of the total flow value of a generalized flow, and propose a polynomial algorithm for this problem. Problem (GMBF) can be regarded as a generalization of the maximum balanced flow problem (MBF) for which several efficient algorithms have been proposed by Minoux and Zimmermann, etc.

Journal

Details 詳細情報について

  • CRID
    1570291227489635968
  • NII Article ID
    110003478636
  • NII Book ID
    AN00351192
  • Text Lang
    en
  • Data Source
    • CiNii Articles

Report a problem

Back to top