Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Friedrich EisenbrandAndreas S. SchulzPublished in: Comb. (2003)
Keyphrases
- strictly convex
- valid inequalities
- lower and upper bounds
- lower bound
- upper bound
- multi dimensional
- worst case
- tight bounds
- convex hull
- upper and lower bounds
- integer programming
- rank order
- information retrieval
- ranked list
- data cube
- packing problem
- feasible solution
- error bounds
- training samples
- extreme points
- uniform convergence
- feasible set
- np hard
- highly ranked
- lattice points