An integer programming column generation principle for heuristic search methods.
Yixin ZhaoTorbjörn LarssonElina RönnbergPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- search methods
- column generation
- integer programming
- lagrangean relaxation
- search algorithm
- lagrangian relaxation
- set covering problem
- mixed integer programming
- set covering
- beam search
- search strategies
- branch and bound
- heuristic function
- set partitioning
- linear programming
- linear programming relaxation
- integer program
- metaheuristic
- np hard
- vehicle routing
- cutting plane
- constraint programming
- optimal solution
- exact solution
- valid inequalities
- production planning
- dantzig wolfe decomposition
- network flow
- cutting plane algorithm
- trust region
- real time search algorithms
- linear program
- vehicle routing problem with time windows
- tabu search
- simulated annealing
- tree search
- constraint satisfaction
- exact methods
- heuristic search
- feasible solution
- combinatorial optimization
- special case