Network flow optimization with minimum quantities
From MaRDI portal
Recommendations
- Minimum cost flows with minimum quantities
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Minimal-cost network flow problems with variable lower bounds on arc flows
- A composite algorithm for a concave-cost network flow problem
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
Cites work
- A branch-and-bound algorithm for concave network flow problems
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Complexity and algorithms for nonlinear optimization problems
- Finding minimum-cost circulations by canceling negative cycles
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Negative-cycle detection algorithms
- On a class of capacitated transportation problems
Cited in
(9)- Minimum cost flows with minimum quantities
- The generalized assignment problem with minimum quantities
- Robust minimum cost flow problem under consistent flow constraints
- Optimizing network flows with congestion-based flow reductions
- A distribution network design problem in the automotive industry: MIP formulation and heuristics
- scientific article; zbMATH DE number 5173820 (Why is no real title available?)
- Robust transshipment problem under consistent flow constraints
- Robust two-stage combinatorial optimization problems under discrete demand uncertainties and consistent selection constraints
- Minimizing costs can be costly
This page was built for publication: Network flow optimization with minimum quantities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232831)
