An Out-of-Kilter Method for Minimal-Cost Flow Problems

DOI10.1137/0109002zbMath0112.12401OpenAlexW2057718356MaRDI QIDQ3849455

D. R. Fulkerson

Publication date: 1961

Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a95d0146dd6bda483fa7f61286eee234d2edbb90

zbMATH Keywords

applications of probability theory and statistics

Related Items (38)

A strongly polynomial minimum cost circulation algorithm ⋮ The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm ⋮ Network flow methods for electoral systems ⋮ A branch‐bound algorithm for the capacitated facilities location problem ⋮ Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm ⋮ A direct dual method for the mixed plant location problem with some side constraints ⋮ Duale transportoptimierung ⋮ Infinite networks: Minimal cost flows ⋮ Penelope's graph: a hard minimum cost tension instance ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ How hard is safe bribery? ⋮ Uncertain minimum cost flow problem ⋮ 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 ⋮ Devisenarbitrage als Flußprobleme ⋮ An “out-of-kilter” algorithm for solving minimum cost potential problems ⋮ A survey of dynamic network flows ⋮ Optimal cocircuits in regular matroids and applications ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ Investments in stochastic maximum flow networks ⋮ The out‐of‐kilter algorithm for solving network problems ⋮ On the computational behavior of a polynomial-time network flow algorithm ⋮ The problem of maximum flow with minimum attainable cost in a network ⋮ Two strongly polynomial cut cancelling algorithms for minimum cost network flow ⋮ Using combinatorial optimization in model-based trimmed clustering with cardinality constraints ⋮ Primal transportation and transshipment algorithms ⋮ Analyse de sensibilité pour les problèmes linéaires en variables 0-1 ⋮ BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT ⋮ The effectiveness of finite improvement algorithms for finding global optima ⋮ Two new algorithms for minimal cost flow problems ⋮ The flow circulation sharing problem ⋮ A solution method for the non-additive resource allocation problem in distributed system design ⋮ An out-of-kilter method for the algebraic circulation problem ⋮ Tight bounds on the number of minimum-mean cycle cancellations and related results ⋮ Ein Markieralgorithmus zur Lösung von allgemeinen Transportproblemen mit einem Bündel ⋮ A fast parallel algorithm for minimum-cost small integral flows

This page was built for publication: An Out-of-Kilter Method for Minimal-Cost Flow Problems