A note on optimal solutions to quadratic knapsack problems.
Haibo WangGary A. KochenbergerYaquan XuPublished in: Int. J. Math. Model. Numer. Optimisation (2010)
Keyphrases
- knapsack problem
- optimal solution
- objective function
- combinatorial optimization problems
- np hard
- test problems
- linear functions
- linear programming relaxation
- metaheuristic
- pairwise
- linear programming
- optimization problems
- linear program
- branch and bound algorithm
- dynamic programming
- np hard problems
- bicriteria
- exact algorithms
- solution quality
- production planning
- lower bound
- multi objective
- search space
- implicit enumeration
- maximum profit
- total cost
- greedy algorithm
- branch and bound
- nsga ii
- feasible solution
- computational complexity
- reinforcement learning
- continuous relaxation
- neural network
- column generation
- solution space
- cutting plane
- greedy heuristic