A polyhedral approach for a constrained matching problem

DOI10.1007/PL00009302zbMath0873.68202MaRDI QIDQ1356081

Peter Kleinschmidt, Andreas Hefner

Publication date: 4 June 1997

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

manpower scheduling problemsweighted matching problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

This page was built for publication: A polyhedral approach for a constrained matching problem