The minimal average cost flow problem
From MaRDI portal
Recommendations
Cites work
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
- A strongly polynomial minimum cost circulation algorithm
- A Survey of Linear Cost Multicommodity Network Flows
- An O (n 2 (m + N log n )log n ) min-cost flow algorithm
- Canceling most helpful total cuts for minimum cost network flow
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 4070602 (Why is no real title available?)
- Multi-Terminal Network Flows
- Multicommodity network flows—A survey
- Optimization of the flow through networks with gains
Cited in
(11)- On the flow cost lowering problem
- Minimum cost multi-product flow lines
- Minimum flow variation in maximum flows
- scientific article; zbMATH DE number 3847193 (Why is no real title available?)
- An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
- A note on the minimum interval cost flow problem
- The fractional minimal cost flow problem on network
- Minimum‐cost flow problems having arc‐activation costs
- Mean‐standard deviation model for minimum cost flow problem
- Minimal-cost network flow problems with variable lower bounds on arc flows
- Assessment of heterogeneous treatment effect estimation accuracy via matching
This page was built for publication: The minimal average cost flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130071)
