Proving Integrality Gaps without Knowing the Linear Program.
Sanjeev AroraBéla BollobásLászló LovászIannis TourlakisPublished in: Theory Comput. (2006)
Keyphrases
- linear program
- mixed integer
- extreme points
- linear programming
- lp relaxation
- integer program
- semi infinite
- optimal solution
- approximate dynamic programming
- column generation
- primal dual
- stochastic programming
- np hard
- interior point methods
- linear programming problems
- simplex method
- multistage stochastic
- mixed integer programming
- linear programming relaxation
- cutting plane
- mixed integer linear program
- simplex algorithm
- feasible solution
- objective function
- average cost
- semidefinite programming
- integer programming
- special case
- evolutionary algorithm