Improving an exact approach for solving separable integer quadratic knapsack problems.
Federico Della CroceDominique QuadriPublished in: J. Comb. Optim. (2012)
Keyphrases
- knapsack problem
- integer variables
- randomly generated test instances
- implicit enumeration
- continuous relaxation
- combinatorial optimization problems
- optimization problems
- test problems
- optimal solution
- np hard
- exact algorithms
- exact solution
- bicriteria
- linear relaxation
- greedy algorithm
- objective function
- production planning
- cutting plane
- dynamic programming
- linear programming relaxation
- maximum profit
- quadratic program
- quadratic programming
- pairwise
- special case
- minimum cost
- np hard problems
- linear functions
- lower bound
- computational complexity
- linear program