Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.
Friedrich EisenbrandAndreas S. SchulzPublished in: IPCO (1999)
Keyphrases
- strictly convex
- valid inequalities
- lower and upper bounds
- upper bound
- lower bound
- convex hull
- data cube
- multi dimensional
- traveling salesman problem
- integer programming
- upper and lower bounds
- lattice points
- worst case
- linear program
- extreme points
- search engine
- learning algorithm
- tight bounds
- average case
- error bounds
- packing problem
- databases
- tabu search
- neural network