The Subspace Flatness Conjecture and Faster Integer Programming.
Victor ReisThomas RothvossPublished in: CoRR (2023)
Keyphrases
- integer programming
- np hard
- linear programming
- constraint programming
- low dimensional
- column generation
- set covering problem
- ai planning
- facility location
- cutting plane algorithm
- feature space
- cutting plane
- production planning
- set covering
- dimensionality reduction
- network flow
- lagrangian relaxation
- inference problems
- valid inequalities
- principal component analysis
- integer program
- crew scheduling
- high dimensional
- special case
- transportation problem
- knapsack problem
- high dimensional data
- vehicle routing problem with time windows
- mixed integer programming
- feasible solution
- round robin tournament
- dantzig wolfe decomposition
- integer programming formulations