Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities.
Timo GschwindStefan IrnichPublished in: OR Spectr. (2017)
Keyphrases
- knapsack problem
- column generation
- optimal solution
- linear programming relaxation
- branch and bound
- dual variables
- cutting plane algorithm
- linear program
- valid inequalities
- combinatorial optimization problems
- dynamic programming
- linear programming
- cutting plane
- decision variables
- np hard
- integer program
- lower bound
- exact algorithms
- set partitioning
- mixed integer programming
- linear relaxation
- mixed integer
- vehicle routing
- integer linear programming
- branch and bound algorithm
- vehicle routing problem with time windows
- maximum profit
- multiple objectives
- exact solution
- lp relaxation
- search space
- continuous relaxation
- implicit enumeration
- integer variables
- primal dual
- integer programming
- metaheuristic
- production planning
- objective function
- dantzig wolfe decomposition
- optimization problems
- linear programming problems
- lagrangian relaxation
- special case
- feasible solution
- greedy algorithm
- heuristic methods
- constant factor
- constraint programming