On the adoption of Metaheuristics for Solving 0-1 Knapsack Problems.
Yang QiuHaomiao LiXiao WangOmar DibPublished in: PAAP (2021)
Keyphrases
- knapsack problem
- optimization problems
- combinatorial optimization problems
- combinatorial optimization
- optimal solution
- randomly generated test instances
- implicit enumeration
- linear relaxation
- vehicle routing problem
- metaheuristic
- test problems
- dynamic programming
- np hard
- np hard problems
- production planning
- information systems
- integer variables
- particle swarm optimization
- traveling salesman problem
- greedy algorithm
- bicriteria
- linear programming relaxation
- machine learning
- neural network
- benchmark problems
- evolutionary algorithm
- objective function
- lower bound
- simulated annealing
- branch and bound algorithm
- feasible solution
- differential evolution
- linear programming
- upper bound
- cost function