A polyhedral approach for a constrained matching problem

DOI10.1007/PL00009302MaRDI QIDQ1356081zbMATH OpenFDO

Authors Andreas Hefner, Peter Kleinschmidt

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)

Recommendations

• An optimal matching problem with constraints
• Matching problems with delta-matroid constraints
• A constrained matching problem
• A Min-Max Theorem for a Constrained Matching Problem
• Constrained matching problems in bipartite graphs
• The popular matching and condensation problems under matroid constraints
• The popular matching and condensation problems under matroid constraints
• Solving various weighted matching problems with constraints
• Linear Systems for Constrained Matching Problems

Cited in

(6)

• A constrained matching problem
• scientific article; zbMATH DE number 5211512 (Why is no real title available?)
• Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators
• A Min-Max Theorem for a Constrained Matching Problem
• Solving various weighted matching problems with constraints
• Bi-objective matchings with the triangle inequality

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356081)