{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:34:50Z","timestamp":1759667690682},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02099694","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T20:03:31Z","timestamp":1126555411000},"page":"135-145","source":"Crossref","is-referenced-by-count":7,"title":["A constrained matching problem"],"prefix":"10.1007","volume":"57","author":[{"given":"Andreas","family":"Hefner","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kleinschmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02099694_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(90)90099-X","volume":"26","author":"R. Aboudi","year":"1990","unstructured":"R. Aboudi and K. J\u00f8rnsten, Resource constrained assignment problems, Discr. Appl. Math. 26(1990)175\u2013191.","journal-title":"Discr. Appl. Math."},{"key":"BF02099694_CR2","unstructured":"R. Aboudi and G.L. Nemhauser, An assignment problem with side constraints: strong cutting planes and separation, in:Economic Decision Making: Games, Econometrics and Optimization, ed. J.J. Gabszewicz et al. (Elsevier, 1990) pp. 457\u2013471."},{"key":"BF02099694_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.39.2.244","volume":"39","author":"R. Aboudi","year":"1991","unstructured":"R. Aboudi and G.L. Nemhauser, Some facets for an assignment problem with side constraints, Oper. Res. 39(1991)244\u2013250.","journal-title":"Oper. Res."},{"key":"BF02099694_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0305-0548(85)90011-5","volume":"12","author":"V. Aggarwal","year":"1985","unstructured":"V. Aggarwal, A Lagrangian-relaxation method for the constrained assignment problem, Comp. Oper. Res. 12(1985)97\u2013106.","journal-title":"Comp. Oper. Res."},{"key":"BF02099694_CR5","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"E. Balas, The prize collecting traveling salesman problem, Networks 19(1989)621\u2013636.","journal-title":"Networks"},{"key":"BF02099694_CR6","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1002\/net.3230200602","volume":"20","author":"M.O. Ball","year":"1990","unstructured":"M.O. Ball, U. Derigs, C. Hildebrand and A. Metz, Matching problems with generalized upper bound side constraints, Networks 20(1990)703\u2013721.","journal-title":"Networks"},{"key":"BF02099694_CR7","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability (Freeman, New York, 1979)."},{"key":"BF02099694_CR8","unstructured":"A. Hefner, A min.max theorem for a constrained matching problem, submitted to SIAM J. Discr. Math. (1995)."},{"key":"BF02099694_CR9","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/322092.322100","volume":"25","author":"A. Itai","year":"1978","unstructured":"A. Itai, M. Rodeh and S.L. Tanimoto, Some matching problems for bipartite graphs, J. ACM 25(1978)517\u2013525.","journal-title":"J. ACM"},{"key":"BF02099694_CR10","first-page":"104","volume":"34","author":"D. K\u00f6nig","year":"1916","unstructured":"D. K\u00f6nig, Gr\u00e1fok \u00e9s alkalmaz\u00e1suk a determin\u00e1nsok \u00e9s halmazok elm\u00e9let\u00e9ben, Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6 34(1916)104\u2013119 (in Hungarian).","journal-title":"Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u00f6"},{"key":"BF02099694_CR11","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"[German transl.: \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Mathematische Annalen 77(1916)453\u2013465.]","journal-title":"Mathematische Annalen"},{"key":"BF02099694_CR12","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"BF02099694_CR13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","volume":"34","author":"J.B. Mazzola","year":"1986","unstructured":"J.B. Mazzola and A.W. Neebe, Resource-constrained assignment scheduling, Oper. Res. 34(1986)560\u2013572.","journal-title":"Oper. Res."},{"key":"BF02099694_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(89)90021-5","volume":"32","author":"M. Padberg","year":"1989","unstructured":"M. Padberg and A. Sassano, The complexity of matching with bonds, Inf. Proc. Lett. 32(1989)297\u2013300.","journal-title":"Inf. Proc. Lett."},{"key":"BF02099694_CR15","volume-title":"Combinatorial Optimization","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization (Prentice-Hall, Englewood Cliffs, NJ, 1982)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099694.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02099694\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02099694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:41:15Z","timestamp":1557794475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02099694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02099694"],"URL":"https:\/\/doi.org\/10.1007\/bf02099694","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}