Combinatorial optimization and local search: A case study of the discount knapsack problem.
Xinliang TianDantong OuyangYiyuan WangHuisi ZhouLuyu JiangLiming ZhangPublished in: Comput. Electr. Eng. (2023)
Keyphrases
- combinatorial optimization
- knapsack problem
- optimization problems
- combinatorial optimization problems
- metaheuristic
- exact algorithms
- traveling salesman problem
- optimal solution
- evolutionary algorithm
- test problems
- branch and bound algorithm
- simulated annealing
- combinatorial problems
- dynamic programming
- branch and bound
- mathematical programming
- memetic algorithm
- objective function
- multidimensional knapsack problem
- greedy algorithm
- np hard
- job shop scheduling problem
- cost function
- linear programming relaxation
- continuous relaxation
- vehicle routing problem
- differential evolution
- quadratic assignment problem
- implicit enumeration
- hard combinatorial optimization problems
- approximation algorithms
- benchmark problems
- particle swarm optimization
- genetic algorithm
- maximum profit