On dual minimum cost flow algorithms (extended abstract)

DOI10.1145/335305.335319zbMath1296.90017OpenAlexW2068265537MaRDI QIDQ3191978

Jens Vygen

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335319

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Minimum-cost flow algorithms: an experimental evaluation

This page was built for publication: On dual minimum cost flow algorithms (extended abstract)