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

Authors:
E.Andrew Boyd
Affiliations:
Department of Industrial Engineering, Texas A&M University, 23 Zavhry Building, College Station, TX 77843-3133, USA
Venue:
Operations Research Letters
Year:
1997

Citing 5
Cited 0

A strongly polynomial algorithm to solve combinatorial linear programs

Operations Research
An application of simultaneous Diophantine approximation in combinatorial optimization

Combinatorica
Integer and combinatorial optimization

Integer and combinatorial optimization
A polynomial-time algorithm for a class of linear complementary problems

Mathematical Programming: Series A and B
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A cutting plane algorithm is presented for finding @e-approximate solutions to integer programs contained in the unit hypercube and represented by a separation oracle. Under the assumption that a polynomially bounded ball is contained in the feasible region of the problem, it is demonstrated that the algorithm is an oracle fully polynomial @e approximation scheme. Implications of the result for 0/1 integer programming are discussed.