A dual version of Tardos's algorithm for linear programming

DOI10.1016/0167-6377(86)90011-8zbMath0626.90054OpenAlexW1975778932WikidataQ59592716 ScholiaQ59592716MaRDI QIDQ581226

James B. Orlin

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/2115

zbMATH Keywords

dual programpolynomial complexities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Related Items (4)

Mobile facility location: combinatorial filtering via weighted occupancy ⋮ A primal-simplex based Tardos' algorithm ⋮ On max-flow min-cut and integral flow properties for multicommodity flows in directed networks ⋮ Multicommodity flows in certain planar directed networks

Cites Work

• A new polynomial-time algorithm for linear programming
• A strongly polynomial minimum cost circulation algorithm
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm

This page was built for publication: A dual version of Tardos's algorithm for linear programming