Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width.
Frank GurskiCarolin RehsPublished in: Math. Methods Oper. Res. (2019)
Keyphrases
- knapsack problem
- optimal solution
- multidimensional knapsack problem
- exact algorithms
- combinatorial optimization problems
- optimization problems
- dynamic programming
- test problems
- multiple objectives
- integer variables
- np hard
- bicriteria
- greedy algorithm
- greedy heuristic
- linear programming relaxation
- independent set
- continuous relaxation
- maximum profit
- lower bound
- benchmark problems
- evolutionary algorithm
- decision variables
- metaheuristic
- heuristic methods
- graph theoretic
- shortest path
- linear programming
- lp relaxation
- feasible solution
- vehicle routing problem
- objective function
- maximum clique
- graph properties
- bayesian networks
- learning algorithm
- genetic algorithm
- quasi cliques
- machine learning