A fully polynomial approximations cutting plane algorithm for integer programs represented by a separation oracle and related results

Conference · Sat Dec 31 00:00:00 EST 1994

OSTI ID:35857

Boyd, A ^[1]

---

1. Texas A&M Univ., College Station, TX (United States)

A cutting plane algorithm for solving integer programs represented by a separation oracle is presented, and it is demonstrated that when properly implemented the algorithm is a fully polynomial approximation scheme. Related results are presented, including a fully polynomial approximation variant of Dantzig/Wolfe decomposition, a fully polynomial approximation algorithm for linear optimization on a convex body, and a polynomial time cutting plane algorithm for the cardinality versions of many well-known combinatorial optimization problems.

• OSTI ID: 35857
• Report Number(s): CONF-9408161-; TRN: 94:009753-0118
• Resource Relation: Conference: 15. international symposium on mathematical programming, Ann Arbor, MI (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Mathematical programming: State of the art 1994; Birge, J.R.; Murty, K.G. [eds.]; PB: 312 p.
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
NONLINEAR PROGRAMMING
ALGORITHMS
OPTIMIZATION
NUMERICAL SOLUTION
CONVERGENCE