A constrained matching problem

DOI10.1007/BF02099694MaRDI QIDQ1897380zbMATH OpenOpenAlexFDO

Authors 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

constrained matchingmanpower schedulingNP-hard problem

Mathematics Subject Classification ID

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

Recommendations

• A Min-Max Theorem for a Constrained Matching Problem
• A polyhedral approach for a constrained matching problem
• Constrained weighted matchings and edge coverings in graphs
• An unfeasible matching problem
• On some matching problems arising in vehicle scheduling models

Cites work

• A Lagrangean relaxation method for the constrained assignment problem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Matching problems with generalized upper bound side constraints
• Resource constrained assignment problems
• Resource-Constrained Assignment Scheduling
• Some Facets for an Assignment Problem with Side Constraints
• The complexity of matching with bonds
• The prize collecting traveling salesman problem
• Two-Commodity Flow

Cited in

(12)

• An unfeasible matching problem
• A polyhedral approach for a constrained matching problem
• A constrained independent set problem for matroids
• Solving various weighted matching problems with constraints
• Assignment problem with conflicts
• Graph matching problems and the NP-hardness of sortedness constraints
• Modelling practical placement of trainee teachers to schools
• A Min-Max Theorem for a Constrained Matching Problem
• Matching with Regular Constraints
• Matching with sizes (or scheduling with processing set restrictions)
• Matching with sizes (or scheduling with processing set restrictions)
• The bipartite margin shop and maximum red matchings free of blue-red alternating cycles

This page was built for publication: A constrained matching problem

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