A Variable Neighborhood Search with Integer Programming for the Zero-One Multiple-Choice Knapsack Problem with Setup.
Yassine AdouaniBassem JarbouiMalek MasmoudiPublished in: ICVNS (2018)
Keyphrases
- integer programming
- variable neighborhood search
- metaheuristic
- tabu search
- heuristic methods
- traveling salesman problem
- routing problem
- np hard
- lagrangian relaxation
- single machine scheduling problem
- benchmark instances
- constraint programming
- vehicle routing problem
- minimum spanning tree
- linear programming
- hybrid method
- search procedure
- set covering problem
- production planning
- column generation
- cutting plane
- valid inequalities
- set covering
- optimization problems
- search space
- memetic algorithm
- simulated annealing
- path relinking
- objective function
- optimal solution
- ant colony optimization
- integer program
- special case
- combinatorial optimization
- feasible solution
- hybrid algorithm