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

DOI10.1016/S0167-6377(96)00048-XzbMATH Open0890.90156OpenAlexW2086322667MaRDI QIDQ1376264FDOQ1376264

Authors: 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

Recommendations

• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
• A simple finite cutting plane algorithm for integer programs
• A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
• Solving \(0/1\) integer programs with enumeration cutting planes
• Approximating Oracle Machines for Combinatorial Optimization

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Geometric algorithms and combinatorial optimization
• Title not available (Why is that?)
• A polynomial-time algorithm for a class of linear complementarity problems
• An application of simultaneous diophantine approximation in combinatorial optimization
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

Cited In (1)

• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376264)