An optimal solution procedure for the multiple tour maximum collection problem using column generation.
Steven E. ButtDavid M. RyanPublished in: Comput. Oper. Res. (1999)
Keyphrases
- column generation
- optimal solution
- branch and bound
- linear programming
- constraint programming
- integer program
- integer programming
- set partitioning
- mixed integer programming
- vehicle routing
- integer linear programming
- linear program
- dynamic programming
- cutting plane
- lagrangean relaxation
- cutting plane algorithm
- lagrangian relaxation
- linear programming relaxation
- valid inequalities
- exact solution
- worst case
- evolutionary algorithm