On DC optimization algorithms for solving minmax flow problems

DOI10.1007/s00186-014-0470-0zbMath1320.90064OpenAlexW2042697086MaRDI QIDQ406644

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)

Related Items (1)

A new mixed integer programming approach for optimization over the efficient set of a multiobjective linear programming problem

Cites Work

• 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
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• 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
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• Global optimization method for solving the minimum maximal flow problem
• Algorithms for the vector maximization problem
• Optimization over the efficient set
• Unnamed Item
• Unnamed Item
• Unnamed Item

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