A Polyhedral Approach for a Constrained Matching Problem

Abstract. Certain manpower scheduling problems can be solved as weighted mat\-ching 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.