On dual minimum cost flow algorithms (extended abstract)
DOI10.1145/335305.335319zbMATH Open1296.90017OpenAlexW2068265537MaRDI QIDQ3191978FDOQ3191978
Authors: 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
Recommendations
- On dual minimum cost flow algorithms
- New polynomial-time cycle-canceling algorithms for minimum-cost flows
- A new strongly polynomial dual network simplex algorithm
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
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)
Cited In (16)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses
- Minimum-cost flow algorithms: an experimental evaluation
- Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks
- A scaling out-of-kilter algorithm for minimum cost flow
- Title not available (Why is that?)
- A dual exterior point simplex type algorithm for the minimum cost network flow problem
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Dual Algorithms for Pure Network Problems
- Title not available (Why is that?)
- Finding minimum-cost flows by double scaling
- A POLYNOMIAL-TIME DUAL SIMPLEX ALGORITHM FOR THE MINIMUM COST FLOW PROBLEM
- A unified framework for primal-dual methods in minimum cost network flow problems
- Efficient implementation of the Goldberg–Tarjan minimum-cost flow algorithm
- Title not available (Why is that?)
- On dual minimum cost flow algorithms
- Relaxed most negative cycle and most positive cut canceling algorithms for minimum cost flow
This page was built for publication: On dual minimum cost flow algorithms (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3191978)
