A new polynomial-time algorithm for linear programming

DOI10.1007/BF02579150zbMath0557.90065OpenAlexW2611147814WikidataQ29543194 ScholiaQ29543194MaRDI QIDQ761967

Narendra K. Karmarkar

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579150

zbMATH Keywords

computational complexitypolynomial time algorithminterior point methodnear optimal solution

Mathematics Subject Classification ID

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

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• Unnamed Item
• Unnamed Item