Automatic integer programming reformulation using variable neighborhood search.
Samuel Souza BritoHaroldo Gambini SantosPublished in: Electron. Notes Discret. Math. (2017)
Keyphrases
- integer programming
- variable neighborhood search
- np hard
- constraint programming
- linear programming
- lagrangian relaxation
- integer program
- metaheuristic
- tabu search
- single machine scheduling problem
- column generation
- cutting plane
- hybrid method
- traveling salesman problem
- set covering problem
- set covering
- valid inequalities
- routing problem
- heuristic methods
- search procedure
- dynamic programming
- network design
- lp relaxation
- vehicle routing problem