Variable neighborhood search for the discounted {0-1} knapsack problem.
Christophe WilbautRaca TodosijevicSaïd HanafiArnaud FrévillePublished in: Appl. Soft Comput. (2022)
Keyphrases
- knapsack problem
- variable neighborhood search
- dynamic programming
- metaheuristic
- vehicle routing problem
- benchmark instances
- exact algorithms
- optimization problems
- optimal solution
- combinatorial optimization problems
- tabu search
- heuristic methods
- traveling salesman problem
- routing problem
- test problems
- minimum spanning tree
- path relinking
- np hard
- evolutionary algorithm
- hybrid method
- linear programming
- combinatorial optimization
- travel time
- multiple objectives
- bi objective
- greedy algorithm
- neural network
- memetic algorithm
- single machine scheduling problem
- genetic algorithm
- multi objective
- lagrangian relaxation
- combinatorial problems
- search algorithm
- cost function