An integer programming approach for the search of discretization orders in distance geometry problems.
Jérémy OmerDouglas Soares GonçalvesPublished in: Optim. Lett. (2020)
Keyphrases
- integer programming
- inference problems
- cutting plane algorithm
- set covering problem
- linear programming
- cutting plane
- np hard
- integer program
- transportation problem
- search algorithm
- lagrangian relaxation
- integer programming formulations
- valid inequalities
- search methods
- column generation
- optimization problems
- ai planning
- constraint programming
- network design problem
- search space
- network flow
- search strategies
- lp relaxation
- search heuristics
- facility location
- vehicle routing problem with time windows
- constraint satisfaction problems
- set covering
- lower bound