Lower bounds for the Chvátal-Gomory rank in the 0/1 cube.
Sebastian PokuttaGautier StaufferPublished in: Oper. Res. Lett. (2011)
Keyphrases
- strictly convex
- lower bound
- objective function
- upper bound
- feasible set
- branch and bound
- np hard
- branch and bound algorithm
- worst case
- multi dimensional
- cutting plane
- data cube
- newton method
- evaluation function
- lower bounding
- linear programming
- lower and upper bounds
- rank order
- optimal cost
- boundary points
- special case
- set of randomly generated instances