Optimal Solutions for a Geometric Knapsack Problem using Integer Programming.
Rafael G. CanoCid C. de SouzaPedro J. de RezendePublished in: CCCG (2018)
Keyphrases
- knapsack problem
- integer programming
- optimal solution
- np hard
- linear programming
- combinatorial optimization problems
- production planning
- lower bound
- column generation
- linear programming relaxation
- multidimensional knapsack problem
- linear program
- greedy heuristic
- scheduling problem
- special case
- branch and bound
- exact algorithms
- cutting plane
- metaheuristic
- objective function
- branch and bound algorithm
- lp relaxation
- np complete
- approximation algorithms
- optimization problems
- maximum profit
- valid inequalities
- worst case
- dynamic programming
- search space
- lagrangian relaxation
- solution quality
- network flow
- vehicle routing problem
- constraint programming
- constraint satisfaction problems
- upper bound
- integer program
- minimum cost
- greedy algorithm
- cutting plane algorithm
- integer programming formulations
- efficient solutions
- cost function
- set partitioning
- computational complexity
- randomly generated test instances