{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T19:22:28Z","timestamp":1698520948555},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0305-0548(96)00089-5","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"757-765","source":"Crossref","is-referenced-by-count":1,"title":["The \u03b2-assignment problem in general graphs"],"prefix":"10.1016","volume":"24","author":[{"given":"Gerard J.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Hsin","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00089-5_BIB1","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","article-title":"A primal method for the assignment and transportation problems","volume":"10","author":"Balinski","year":"1964","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problems","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Research and Logistics Quarterly"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/nav.3800030404","article-title":"Variants of the Hungarian methods for assignment problems","volume":"3","author":"Kuhn","year":"1956","journal-title":"Naval Research and Logistics Quarterly"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB4","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB5","series-title":"Combinational Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0305-0548(88)90063-9","article-title":"On a scheduling problem where a job can be executed only by a limited number of processors","volume":"15","author":"Chang","year":"1988","journal-title":"Computers and Operation Research"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB7","series-title":"Proc. 3rd Int. Conf. for Young Computer Scientists","article-title":"A weighted job assignment problem and #P-complete result","author":"Chang","year":"1993"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB8","doi-asserted-by":"crossref","unstructured":"Chang, G. J. and Ho, P-H., The \u03b2-assignment problems, European Journal of Operations Research, to appear.","DOI":"10.1016\/S0377-2217(97)00008-8"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"Journal of the London Mathematical Society"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB10","article-title":"Labeling to obtain a maximum matching","author":"Balinski","year":"1967","journal-title":"Mimeographed paper"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB11","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canadian Journal of Mathematics"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB12","series-title":"Mimeographed notes","article-title":"An introduction to matching","author":"Edmonds","year":"1967"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB13","series-title":"Proceedings of 16th Annual Symposium on Foundations of Computer Science","first-page":"100","article-title":"An O(n2.5) algorithm for maximum matching in general graphs","author":"Even","year":"1975"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB14","series-title":"Proceedings of 21st Annual Symposium on Foundations of Computer Science","first-page":"17","article-title":"An O(|V|0.5|E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB15","series-title":"Graph Theory With Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB16","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0305-0548(96)00089-5_BIB17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054896000895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:27:34Z","timestamp":1556396854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054896000895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0305054896000895"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00089-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}