A Schedule Algebra Based Approach to Determine the K-Best Solutions of a Knapsack Problem with a Single Constraint.
Subhash C. SarinYuqiang WangDae B. ChangPublished in: AAIM (2005)
Keyphrases
- knapsack problem
- optimal solution
- multidimensional knapsack problem
- integer variables
- exact algorithms
- combinatorial optimization problems
- test problems
- multiple objectives
- dynamic programming
- np hard
- optimization problems
- scheduling problem
- greedy heuristic
- linear programming relaxation
- decision variables
- greedy algorithm
- lp relaxation
- bicriteria
- solution quality
- np hard problems
- feasible solution
- efficient solutions
- linear constraints
- heuristic solution
- benchmark problems