New class of 0-1 integer programs with tight approximation via linear relaxations.
Armen S. AsratianNikolai N. KuzjurinPublished in: Math. Methods Oper. Res. (2001)
Keyphrases
- integer program
- lower bound
- linear programming relaxation
- column generation
- integer programming
- cutting plane
- linear programming
- linear program
- linear functions
- closed form
- submodular functions
- approximation algorithms
- lp relaxation
- worst case
- semidefinite
- multistage stochastic
- np hard
- convex functions
- continuous functions
- computational complexity
- metaheuristic
- optimal policy