Local minima for indefinite quadratic knapsack problems.
Stephen A. VavasisPublished in: Math. Program. (1992)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- optimization problems
- np hard
- pairwise
- test problems
- exact algorithms
- dynamic programming
- linear programming relaxation
- linear functions
- objective function
- greedy algorithm
- simulated annealing
- continuous relaxation
- computational complexity
- production planning
- global minimum
- np hard problems
- implicit enumeration
- maximum profit
- deductive databases
- evolutionary algorithm
- search space
- constraint databases
- cutting plane
- computational efficiency