A Column Generation Based Heuristic for a Temporal Bin Packing Problem.
Alexey RatushnyiYury KochetovPublished in: MOTOR (2021)
Keyphrases
- column generation
- lagrangean relaxation
- integer linear programming
- mixed integer programming
- optimal solution
- lagrangian relaxation
- branch and bound
- set covering
- set covering problem
- lower bound
- grasp with path relinking
- bin packing
- linear programming
- packing problem
- linear programming relaxation
- integer programming
- dantzig wolfe
- hybrid meta heuristic
- linear program
- vehicle routing
- integer program
- exact solution
- constraint programming
- complete search
- cutting plane
- set partitioning
- knapsack problem
- vehicle routing problem with time windows
- beam search
- dantzig wolfe decomposition
- linear programming problems
- dynamic programming
- branch and bound algorithm
- search strategies
- valid inequalities
- objective function
- combinatorial optimization
- search algorithm
- feasible solution
- search space
- genetic algorithm
- np hard
- scheduling problem
- metaheuristic
- tabu search
- exact algorithms