Network Flow Optimization with Minimum Quantities
From MaRDI portal
Publication:5232831
DOI10.1007/978-3-642-20009-0_47zbMath1421.90037MaRDI QIDQ5232831
Publication date: 13 September 2019
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_47
90C35: Programming involving graphs or networks
90B10: Deterministic network models in operations research
Related Items
Robust transshipment problem under consistent flow constraints, Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints, The generalized assignment problem with minimum quantities, A distribution network design problem in the automotive industry: MIP formulation and heuristics, Minimum cost flows with minimum quantities, Robust minimum cost flow problem under consistent flow constraints
Cites Work
- Unnamed Item
- Negative-cycle detection algorithms
- Complexity and algorithms for nonlinear optimization problems
- A branch-and-bound algorithm for concave network flow problems
- On a Class of Capacitated Transportation Problems
- Finding minimum-cost circulations by canceling negative cycles
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm