A fully polynomial approximations cutting plane algorithm for integer programs represented by a separation oracle and related results
Conference
·
OSTI ID:35857
- 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--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Relaxed Multibang Regularization for the Combinatorial Integral Approximation
Generalized fractional programming and cutting plane algorithms
Polyhedral approximation in mixed-integer convex optimization
Journal Article
·
Thu Jul 15 00:00:00 EDT 2021
· SIAM Journal on Control and Optimization
·
OSTI ID:1813096
Generalized fractional programming and cutting plane algorithms
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:35809
Polyhedral approximation in mixed-integer convex optimization
Journal Article
·
Thu Sep 14 00:00:00 EDT 2017
· Mathematical Programming
·
OSTI ID:1663183