Extended decomposition for mixed integer programming to solve a workforce scheduling and routing problem
We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. We present a mixed integer programming model tha...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Book Section |
| Published: |
Springer
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31298/ |