OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Yamamoto Yoshitsugu

  University Of Tsukuba

• Yamamoto Yoshitsugu

  Univ. Tsukuba

• Zenke Daisuke

  Japan Defense Agency

関連論文

• A NOTE ON A THEOREM OF CONTINUUM OF ZERO POINTS
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
• RANKING BY RELATIONAL POWER BASED ON DIGRAPHS
• A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS
• LAGRANGIAN RELAXATION AND PEGGING TEST FOR LINEAR ORDERING PROBLEMS(SCOPE (Seminar on Computation and OPtimization for new Extensions))

スポンサーリンク