A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
From MaRDI portal
Publication:1184354
DOI10.1007/BF01585711zbMath0763.90041OpenAlexW1973431384MaRDI QIDQ1184354
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585711
global optimizationdecomposition methodnonconvex optimizationhierarchical structurepricing mechanismdirected, uncapacitated networksmin concave cost flow problems
Programming involving graphs or networks (90C35) Nonsmooth analysis (49J52) Deterministic network models in operations research (90B10) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A decomposition method for the min concave cost flow problem with a staircase structure, On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope, Probabilistic local search algorithms for concave cost transportation network problems, Global and local search algorithms for concave cost transshipment problems, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Cites Work
- Unnamed Item
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- An algorithm for the min concave cost flow problem
- Lower planes for the network design problem
- A decomposition method for the min concave cost flow problem with a staircase structure
- Tailoring Benders decomposition for uncapacitated network design
- Adjacent extreme flows and application to min concave cost flow problems
- A method for globally minimizing concave functions over convex sets
- The complexity of the network design problem
- Optimal Facility Location with Concave Costs
- Minimum Concave Cost Flows in Certain Networks
- Convex Analysis
