| Article ID: | iaor1998881 |
| Country: | United States |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 429 |
| End Page Number: | 437 |
| Publication Date: | Jun 1997 |
| Journal: | Discrete and Computational Geometry |
| Authors: | Kleinschmidt P., Hefner A. |
| Keywords: | personnel & manpower planning |
Certain manpower scheduling problems can be solved as weighted matching problems with additional constraints. A complete linear description of a polytope whose vertices correspond to such matchings is provided and how this can be used for solving more complex problems with a cutting plane procedure is described.