Using the Johnson-Lindenstrauss lemma in linear and integer programming.
Ky Khac VuPierre-Louis PoirionLeo LibertiPublished in: CoRR (2015)
Keyphrases
- johnson lindenstrauss
- integer programming
- np hard
- linear programming
- production planning
- high dimensional
- column generation
- constraint programming
- cutting plane
- network flow
- facility location
- set covering problem
- lagrangian relaxation
- dantzig wolfe decomposition
- ai planning
- integer program
- valid inequalities
- set covering
- cutting plane algorithm
- inference problems
- lower bound
- set partitioning
- transportation problem
- linear programming relaxation