A network simplex algorithm for solving the minimum distribution cost problem
From MaRDI portal
Publication:2379832
Recommendations
- A network simplex method for the budget-constrained minimum cost flow problem
- scientific article; zbMATH DE number 1532274
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- A simplex algorithm for minimum-cost network-flow problems in infinite networks
- A distributed transportation simplex applied to a Content Distribution Network problem
- scientific article; zbMATH DE number 795215
- An exterior simplex type algorithm for the minimum cost network flow problem
- scientific article; zbMATH DE number 1086915
- An efficient implementation of the network simplex method
- scientific article; zbMATH DE number 1927152
Cited in
(7)- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
- Maximum flows in generalized processing networks
- A compaction scheme and generator for distribution networks
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem
- An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions
- A distributed transportation simplex applied to a Content Distribution Network problem
- A manufacturing supply chain optimization model for distilling process
This page was built for publication: A network simplex algorithm for solving the minimum distribution cost problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379832)