A decomposition method for the min concave cost flow problem with a staircase structure
From MaRDI portal
Publication:3471825
DOI10.1007/BF03167893zbMath0695.90042MaRDI QIDQ3471825
No author found.
Publication date: 1990
Published in: Japan Journal of Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Cites Work
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- An algorithm for the min concave cost flow problem
- A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
- Generalized Benders decomposition
- Lower planes for the network design problem
- Concave minimization under linear constraints with special structure
- Tailoring Benders decomposition for uncapacitated network design
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global minimization of a difference of two convex functions
- Adjacent extreme flows and application to min concave cost flow problems
- A method for globally minimizing concave functions over convex sets
- On building minimum cost communication networks
- The complexity of the network design problem
- Optimal Facility Location with Concave Costs
- Minimum Concave Cost Flows in Certain Networks
- Minimum cost routing for static network models
