Cover by disjoint cliques cuts for the knapsack problem with conflicting items.
Thiago Alcântara LuizHaroldo Gambini SantosEduardo UchoaPublished in: Oper. Res. Lett. (2021)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimization problems
- dynamic programming
- optimal solution
- pairwise
- multidimensional knapsack problem
- np hard
- test problems
- exact algorithms
- greedy algorithm
- np hard problems
- bicriteria
- linear programming relaxation
- heuristic solution
- greedy heuristic
- decision variables
- continuous relaxation
- approximation algorithms
- random variables
- cutting plane
- maximal cliques
- evolutionary algorithm
- maximum profit