A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts.
Stefano ConiglioFabio FuriniPablo San SegundoPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- knapsack problem
- branch and bound algorithm
- optimal solution
- np hard
- branch and bound
- test problems
- lower bound
- combinatorial optimization problems
- exact algorithms
- upper bounding
- optimization problems
- upper bound
- lower bounding
- randomly generated problems
- linear programming relaxation
- precedence constraints
- production planning
- max sat
- single machine scheduling problem
- combinatorial optimization
- mixed integer linear programming
- multidimensional knapsack problem
- linear programming
- lagrangian relaxation
- metaheuristic
- scheduling problem
- integer variables
- linear program
- dynamic programming
- special case
- finding an optimal solution
- objective function
- column generation
- np complete
- search space
- approximation algorithms
- solution quality
- maximum profit
- integer programming
- greedy algorithm
- feasible solution
- search algorithm
- genetic algorithm