Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.
Sergey PolyakovskiyFrank NeumannPublished in: CoRR (2014)
Keyphrases
- mixed integer programming
- knapsack problem
- linear programming relaxation
- production planning
- binary variables
- maximum profit
- column generation
- valid inequalities
- lot sizing
- optimization problems
- np hard
- neural network
- dynamic programming
- exact algorithms
- network design problem
- optimal solution
- scheduling problem
- lagrangian relaxation
- reinforcement learning