A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
From MaRDI portal
Publication:5564921
DOI10.1287/mnsc.14.3.205zbMath0178.22902OpenAlexW2166541787WikidataQ30048073 ScholiaQ30048073MaRDI QIDQ5564921
Publication date: 1967
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.14.3.205
Related Items (52)
Computing maximum mean cuts ⋮ The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm ⋮ A hybrid algorithm for solving convex separable network flow problems ⋮ Quadratically Regularized Optimal Transport on Graphs ⋮ Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ A transportation type aggregate production model with bounds on inventory and backordering ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem ⋮ Scaling: A general framework ⋮ A strongly polynomial contraction-expansion algorithm for network flow problems ⋮ Approximate Wasserstein attraction flows for dynamic mass transport over networks ⋮ APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ Penelope's graph: a hard minimum cost tension instance ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Uncertain minimum cost flow problem ⋮ Flow constrained minimum cost flow problem ⋮ Pickup and Delivery of Partial Loads with “Soft” Time Windows ⋮ A survey on exact algorithms for the maximum flow and minimum‐cost flow problems ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Unnamed Item ⋮ Convexification of generalized network flow problem ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Weighted min cost flows ⋮ About the minimum mean cycle-canceling algorithm ⋮ A zero-space algorithm for negative cost cycle detection in networks ⋮ The problem of maximum flow with minimum attainable cost in a network ⋮ Negative circuits for flows and submodular flows ⋮ Polynomial-time primal simplex algorithms for the minimum cost network flow problem ⋮ Collaborative vehicle routing: a survey ⋮ Algorithms for the minimum cost circulation problem based on maximizing the mean improvement ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ Algorithms for storage allocation based on client preferences ⋮ Sokoban: Enhancing general single-agent search methods using domain knowledge ⋮ New polynomial-time cycle-canceling algorithms for minimum-cost flows ⋮ More pathological examples for network flow problems ⋮ Solving coalitional resource games ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ Balanced-flow algorithm for path network planning in hierarchical spaces ⋮ Testing of a large-scale network optimization program ⋮ A faster polynomial algorithm for the unbalanced Hitchcock transportation problem ⋮ Engineering Negative Cycle Canceling for Wind Farm Cabling ⋮ A note on primal network flow algorithms ⋮ Algorithms for the metric ring star problem with fixed edge-cost ratio ⋮ Margin of victory for tournament solutions ⋮ Optimal \(K\)-node disruption on a node-capacitated network ⋮ Two new algorithms for minimal cost flow problems ⋮ A parametric algorithm for convex cost network flow and related problems ⋮ Unnamed Item ⋮ Tight bounds on the number of minimum-mean cycle cancellations and related results ⋮ A bad network problem for the simplex method and other minimum cost flow algorithms
This page was built for publication: A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
