zbMath0684.90062MaRDI QIDQ4735034
Narendra K. Karmarkar
Publication date: 1989
zbMATH Keywords
computational complexity; polynomial time algorithm; interior point method; near optimal solution
Mathematics Subject Classification ID
68Q25: Analysis of algorithms and problem complexity
90C05: Linear programming
Related Items