A constrained matching problem
type: Item
instance of: scholarly article
title: A constrained matching problem
zbMATH Open document ID: 0831.90074
DOI: 10.1007/BF02099694
author: Andreas Hefner
author: Peter Kleinschmidt
published in: Annals of Operations Research
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 790513
zbMATH Keywords: manpower scheduling
zbMATH Keywords: constrained matching
zbMATH Keywords: NP-hard problem
MaRDI profile type: Publication
cites work: Resource constrained assignment problems
cites work: Some Facets for an Assignment Problem with Side Constraints
cites work: A Lagrangean relaxation method for the constrained assignment problem
cites work: The prize collecting traveling salesman problem
cites work: Matching problems with generalized upper bound side constraints
cites work: Q4198056
cites work: Two-Commodity Flow
cites work: Q3048571
cites work: Resource-Constrained Assignment Scheduling
cites work: The complexity of matching with bonds
cites work: Q4739657
full work available at URL: https://doi.org/10.1007/bf02099694
OpenAlex ID: W2004108795
description: scientific article; zbMATH DE number 790513