Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.
Sergey PolyakovskiyFrank NeumannPublished in: CPAIOR (2015)
Keyphrases
- mixed integer programming
- knapsack problem
- linear programming relaxation
- production planning
- binary variables
- maximum profit
- column generation
- lot sizing
- valid inequalities
- mixed integer
- optimization problems
- network design problem
- np hard
- dynamic programming
- optimal solution
- branch and bound
- linear program
- decision trees
- lagrangian relaxation
- upper bound
- cutting plane