Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem.
Pierre HansenJack BrimbergDragan UrosevicNenad MladenovicPublished in: INFORMS J. Comput. (2007)
Keyphrases
- primal dual
- variable neighborhood search
- linear programming
- metaheuristic
- tabu search
- linear program
- traveling salesman problem
- convex optimization
- convergence rate
- routing problem
- minimum spanning tree
- heuristic methods
- hybrid method
- benchmark instances
- approximation algorithms
- algorithm for linear programming
- single machine scheduling problem
- vehicle routing problem
- semidefinite programming
- search procedure
- path relinking
- valid inequalities
- optimal solution
- spanning tree
- feasible solution
- dynamic programming
- lower and upper bounds
- graph theory
- support vector machine
- scheduling problem
- search algorithm
- genetic algorithm