A constrained matching problem

DOI10.1007/BF02099694zbMath0831.90074OpenAlexW2004108795MaRDI QIDQ1897380

Andreas Hefner, Peter Kleinschmidt

Publication date: 27 August 1995

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02099694

zbMATH Keywords

manpower schedulingNP-hard problemconstrained matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Modelling practical placement of trainee teachers to schools ⋮ A constrained independent set problem for matroids ⋮ Assignment problem with conflicts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Lagrangean relaxation method for the constrained assignment problem
• The complexity of matching with bonds
• Resource constrained assignment problems
• Matching problems with generalized upper bound side constraints
• Resource-Constrained Assignment Scheduling
• The prize collecting traveling salesman problem
• Some Facets for an Assignment Problem with Side Constraints
• Two-Commodity Flow

This page was built for publication: A constrained matching problem