On DC optimization algorithms for solving minmax flow problems

DOI10.1007/S00186-014-0470-0zbMATH Open1320.90064OpenAlexW2042697086MaRDI QIDQ406644FDOQ406644

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

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

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• 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)