A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball

DOI10.1016/S0167-6377(96)00048-XzbMath0890.90156OpenAlexW2086322667MaRDI QIDQ1376264

E. Andrew Boyd

Publication date: 17 December 1997

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00048-x

zbMATH Keywords

cutting plane algorithm\(\varepsilon\)-approximate solutions

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• An application of simultaneous diophantine approximation in combinatorial optimization
• A polynomial-time algorithm for a class of linear complementarity problems
• Geometric algorithms and combinatorial optimization
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

This page was built for publication: A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball