A Column Generation based Heuristic for the Tail Assignment Problem.
Akash SambrekarEl Mehdi Er RaqabiPublished in: CoRR (2020)
Keyphrases
- column generation
- lagrangean relaxation
- optimal solution
- lagrangian relaxation
- integer linear programming
- mixed integer programming
- set covering problem
- set covering
- linear programming
- branch and bound
- grasp with path relinking
- linear programming relaxation
- dantzig wolfe
- linear program
- hybrid meta heuristic
- integer programming
- np hard
- vehicle routing
- set partitioning
- complete search
- constraint programming
- exact solution
- linear programming problems
- vehicle routing problem with time windows
- integer program
- cutting plane
- valid inequalities
- feasible solution
- search algorithm
- linear relaxation
- dantzig wolfe decomposition
- lower bound
- branch and bound algorithm
- beam search
- search strategies
- solution quality
- heuristic methods
- combinatorial optimization
- dynamic programming
- cutting plane algorithm
- reinforcement learning
- cost function