Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem.
Wasakorn LaesanklangRodrigo Lankaites PinheiroHaneen AlgethamiDario Landa-SilvaPublished in: ICORES (Selected Papers) (2015)
Keyphrases
- routing problem
- mixed integer programming
- vehicle routing
- column generation
- qos multicast routing
- production planning
- mixed integer
- vehicle routing problem
- lot sizing
- vehicle routing problem with time windows
- valid inequalities
- set partitioning
- travel time
- traveling salesman problem
- linear programming relaxation
- scheduling problem
- routing algorithm
- lagrangian relaxation
- shortest path
- continuous variables
- branch and bound
- particle swarm optimization
- special case