On DC optimization algorithms for solving minmax flow problems

DOI10.1007/S00186-014-0470-0MaRDI QIDQ406644zbMATH OpenOpenAlexFDO

Authors Le Dung Muu, Le Quang Thuy

Publication date 8 September 2014

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-014-0470-0

zbMATH Keywords

regularizationDC primal-dual algirithmminmax flow problemsmooth DC optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29)

Recommendations

• D.c. optimization methods for solving minimum maximal network flow problem
• OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
• scientific article; zbMATH DE number 2190137
• A global optimization method for minimum maximal flow problem
• A dual algorithm for submodular flow problems

Cites work

• scientific article; zbMATH DE number 1070351 (Why is no real title available?)
• scientific article; zbMATH DE number 1086738 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A global optimization method for minimum maximal flow problem
• Algorithms for the vector maximization problem
• An all-linear programming relaxation algorithm for optimizing over the efficient set
• An extended descent framework for variational inequalities
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Global optimization method for solving the minimum maximal flow problem
• Minimum maximal flow problem: An optimization over the efficient set
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• Optimization over the efficient set
• Optimization over the efficient set: overview
• Simplicially-constrained DC optimization over efficient and weakly efficient sets

Cited in

(5)

• scientific article; zbMATH DE number 2190137 (Why is no real title available?)
• A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem
• Separable convexification and DCA techniques for capacity and flow assignment problems.
• D.c. optimization methods for solving minimum maximal network flow problem
• Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA

This page was built for publication: On DC optimization algorithms for solving minmax flow problems

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