Some lower bounds on sparse outer approximations of polytopes.
Santanu S. DeyAndres IroumeMarco MolinaroPublished in: Oper. Res. Lett. (2015)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- branch and bound
- objective function
- compressive sensing
- sparse data
- optimal solution
- high dimensional
- convex hull
- lattice points
- optimal cost
- vc dimension
- data structure
- free energy
- max sat
- lower bounding
- quadratic assignment problem
- approximation methods
- valid inequalities
- cutting plane
- packing problem
- upper and lower bounds
- worst case
- sample complexity
- sparse representation