The minimal average cost flow problem

DOI10.1016/0377-2217(93)E0348-2zbMath0912.90126OpenAlexW2094286968MaRDI QIDQ1130071

S. H. Smith

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0348-2

zbMATH Keywords

arc capacitiesflow costsmin-cost flow problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions

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 ² (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

This page was built for publication: The minimal average cost flow problem