Searching for optimal integer solutions to set partitioning problems using column generation.
David BredströmKurt JörnstenMikael RönnqvistMathieu BouchardPublished in: Int. Trans. Oper. Res. (2014)
Keyphrases
- column generation
- set partitioning
- optimal solution
- exact solution
- linear relaxation
- mixed integer programming
- integer program
- branch and bound
- linear programming
- integer programming
- vehicle routing problem with time windows
- cutting plane
- dantzig wolfe decomposition
- linear program
- approximate solutions
- vehicle routing
- benchmark problems
- branch and bound algorithm
- constraint programming
- dynamic programming
- lagrangian relaxation
- heuristic methods
- np hard
- linear programming relaxation
- exact algorithms
- combinatorial problems
- solution quality
- feasible solution
- objective function
- lower bound
- difficult problems
- np complete
- minimum cost
- search strategies
- knapsack problem
- lp relaxation
- metaheuristic
- upper bound
- particle swarm optimization
- simulated annealing
- optimization problems
- combinatorial optimization
- problems involving