The minimal average cost flow problem
From MaRDI portal
Publication:1130071
DOI10.1016/0377-2217(93)E0348-2zbMath0912.90126MaRDI QIDQ1130071
Publication date: 16 August 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B10: Deterministic network models in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- A strongly polynomial minimum cost circulation algorithm
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Multi-Terminal Network Flows
- A Survey of Linear Cost Multicommodity Network Flows
- Multicommodity network flows—A survey
- Canceling most helpful total cuts for minimum cost network flow
- Optimization of the flow through networks with gains