OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM

Access this Article

Search this Article

Author(s)

Abstract

The minimum maximal flow problem is the problem of minimizing the flow value on the set of maximal flows of a given network. The optimal value indicates how inefficiently the network can be utilized in the presence of some uncontrollability. After extending the gap function characterizing the set of maximal flows, we reformulate the problem as a D.C. optimization problem, and then propose an outer approximation algorithm. The algorithm, based on the idea of ε-optimal solution and local search technique, terminates after finitely many iterations with the optimal value of the problem.

Journal

  • Journal of the Operations Research Society of Japan

    Journal of the Operations Research Society of Japan 50(1), 14-30, 2007

    The Operations Research Society of Japan

References:  34

Cited by:  1

Codes

  • NII Article ID (NAID)
    110006241948
  • NII NACSIS-CAT ID (NCID)
    AA00703935
  • Text Lang
    ENG
  • Article Type
    Journal Article
  • ISSN
    0453-4514
  • NDL Article ID
    8690277
  • NDL Source Classification
    ZM31(科学技術--数学) // ZD25(経済--企業・経営--経営管理)
  • NDL Call No.
    Z53-M226
  • Data Source
    CJP  CJPref  NDL  NII-ELS  J-STAGE 
Page Top