Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
From MaRDI portal
Publication:4946702
DOI10.1080/10556789808805709zbMath0949.90008OpenAlexW2371831755MaRDI QIDQ4946702
Ursula Bünnagel, Bernhard Korte, Jens Vygen
Publication date: 23 March 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789808805709
heuristicsimplementationefficient algorithmsefficient implementationGoldberg-Tarjan algorithmcost-scaling algorithmminimum-cost flow problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (3)
Minimum-cost flow algorithms: an experimental evaluation ⋮ Pricing and clearing combinatorial markets with singleton and swap orders. Efficient algorithms for the futures opening auction problem ⋮ On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
This page was built for publication: Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
