OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM

DOI10.15807/JORSJ.50.14MaRDI QIDQ5425802zbMATH OpenOpenAlexFDO

Authors Yoshitsugu Yamamoto, D. Zenke

Publication date 14 November 2007

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.50.14

zbMATH Keywords

global optimizationnetwork flowouter approximationD.C. optimizationoptimization over the efficient setminimum maximal flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 2190137
• D.c. optimization methods for solving minimum maximal network flow problem
• Global optimization method for solving the minimum maximal flow problem
• Minimum maximal flow problem: An optimization over the efficient set
• A global optimization method for minimum maximal flow problem

Cited in

(6)

• scientific article; zbMATH DE number 2190137 (Why is no real title available?)
• On DC optimization algorithms for solving minmax flow problems
• Minimum maximal flow problem: An optimization over the efficient set
• D.c. optimization methods for solving minimum maximal network flow problem
• A mixed integer programming approach for the minimum maximal flow
• Global optimization method for solving the minimum maximal flow problem

This page was built for publication: OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425802)