Approximation of knapsack problems with conflict and forcing graphs.
Ulrich PferschyJoachim SchauerPublished in: J. Comb. Optim. (2017)
Keyphrases
- knapsack problem
- linear programming relaxation
- test problems
- optimal solution
- optimization problems
- combinatorial optimization problems
- dynamic programming
- exact algorithms
- production planning
- greedy algorithm
- conflict resolution
- np hard
- graph theory
- bicriteria
- cutting plane
- graph theoretic
- graph matching
- linear functions
- graph structure
- approximation guarantees
- np hard problems
- learning algorithm
- maximum profit
- nsga ii
- weighted graph
- approximation algorithms
- directed graph
- linear program
- search algorithm