Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm

DOI10.1080/10556789808805709zbMATH Open0949.90008OpenAlexW2371831755MaRDI QIDQ4946702FDOQ4946702

Authors: Ursula Bünnagel, Bernhard Korte, Jens Vygen 

Publication date: 23 March 2000

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789808805709

Recommendations

• scientific article; zbMATH DE number 1263274
• On dual minimum cost flow algorithms (extended abstract)
• scientific article; zbMATH DE number 515928
• Minimum-cost flow algorithms: an experimental evaluation
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

zbMATH Keywords

heuristicsimplementationefficient algorithmsefficient implementationGoldberg-Tarjan algorithmcost-scaling algorithmminimum-cost flow problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cited In (5)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

This page was built for publication: Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946702)