Lifting Cover Inequalities for the Precedence-constrained Knapsack Problem.
Kyungchul ParkSungsoo ParkPublished in: Discret. Appl. Math. (1997)
Keyphrases
- knapsack problem
- cover inequalities
- binary variables
- linear program
- optimal solution
- combinatorial optimization problems
- dynamic programming
- np hard
- optimization problems
- convex hull
- exact algorithms
- continuous variables
- multidimensional knapsack problem
- production planning
- greedy algorithm
- linear programming relaxation
- cutting plane
- metaheuristic
- linear programming
- continuous relaxation
- maximum profit
- special case
- dynamic systems
- traveling salesman problem
- lower bound
- implicit enumeration
- facet defining inequalities
- reinforcement learning