Title of article
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball
Author/Authors
E. Andrew Boyd، نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1997
Pages
5
From page
59
To page
63
Keywords
Polynomial approximation schemes , Cutting planes , integer programming
Journal title
Operations Research Letters
Serial Year
1997
Journal title
Operations Research Letters
Record number
137045
Link To Document