D.c. optimization methods for solving minimum maximal network flow problem
From MaRDI portal
Recommendations
- On DC optimization algorithms for solving minmax flow problems
- OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
- scientific article; zbMATH DE number 2190137
- A global optimization method for minimum maximal flow problem
- Global optimization method for solving the minimum maximal flow problem
Cited in
(8)- scientific article; zbMATH DE number 2190137 (Why is no real title available?)
- D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
- On DC optimization algorithms for solving minmax flow problems
- OUTER APPROXIMATION METHOD FOR THE MINIMUM MAXIMAL FLOW PROBLEM
- Minimum maximal flow problem: An optimization over the efficient set
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- 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: D.c. optimization methods for solving minimum maximal network flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626017)
