{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T17:10:35Z","timestamp":1709313035001},"reference-count":10,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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,11]]},"DOI":"10.1016\/s0305-0548(97)00019-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"1017-1023","source":"Crossref","is-referenced-by-count":10,"title":["A new algorithm for the assignment problem: An alternative to the Hungarian method"],"prefix":"10.1016","volume":"24","author":[{"given":"Ping","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.B.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00019-1_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0305-0548(89)90028-2","article-title":"A labeling algorithm to solve the assignment problem","volume":"16","author":"Lotfi","year":"1989","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01580579","article-title":"A competitive (dual) simplex method for the assignment problem","volume":"34","author":"Balinski","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01582245","article-title":"Efficient dual simplex methods for the assignment problem","volume":"33","author":"Goldfarb","year":"1985","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB5","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1287\/opre.31.3.595","article-title":"A polynomial simplex method for the assignment problem","volume":"31","author":"Hung","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01586925","article-title":"An infeasible (exterior point) simplex algorithm for assignment problems","volume":"51","author":"Paparrizos","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/opre.33.3.527","article-title":"Signature methods for the assignment problem","volume":"33","author":"Balinski","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01586040","article-title":"New scaling algorithms for the assignment and minimum mean cycle problems","volume":"54","author":"Orlin","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB9","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1287\/opre.28.4.969","article-title":"Solving the assignment problem by relaxation","volume":"28","author":"Hung","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00019-1_BIB10","series-title":"Introduction to Operations Research","author":"Hillier","year":"1995"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:21:34Z","timestamp":1555204894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":10,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0305054897000191"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00019-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}