Network Flow Optimization with Minimum Quantities

DOI10.1007/978-3-642-20009-0_47zbMath1421.90037OpenAlexW2270669054MaRDI QIDQ5232831

Hans Georg Seedig

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (6)

A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ Robust minimum cost flow problem under consistent flow constraints ⋮ Robust transshipment problem under consistent flow constraints ⋮ Minimum cost flows with minimum quantities ⋮ Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints ⋮ The generalized assignment problem with minimum quantities

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

This page was built for publication: Network Flow Optimization with Minimum Quantities