{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T21:11:47Z","timestamp":1718053907664},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Asia Pac. J. Oper. Res."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p> Alternative optimal solutions can give more choice for practical decision making. Therefore, the provision of methods for finding alternative optimal solutions is an important component part of the solution techniques for optimization models. The aim of this paper is to present a branch-and-bound algorithm for finding all optimal solutions of the linear assignment problem. Numerical experimental results are also given. <\/jats:p>","DOI":"10.1142\/s0217595907001565","type":"journal-article","created":{"date-parts":[[2008,1,11]],"date-time":"2008-01-11T05:51:30Z","timestamp":1200030690000},"page":"831-839","source":"Crossref","is-referenced-by-count":4,"title":["A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM"],"prefix":"10.1142","volume":"24","author":[{"given":"ZHUO","family":"FU","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China"}]},{"given":"RICHARD","family":"EGLESE","sequence":"additional","affiliation":[{"name":"Lancaster University, Lancaster, UK"}]},{"given":"MIKE","family":"WRIGHT","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation Engineering, Central South University at Railway Campus, Changsha 410075, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00172-9"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0155"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.4.969"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278710"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100205"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"rf8","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00439-3"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.682"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.015"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(90)90031-2"}],"container-title":["Asia-Pacific Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0217595907001565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:58:56Z","timestamp":1565171936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0217595907001565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0217595907001565"],"URL":"https:\/\/doi.org\/10.1142\/s0217595907001565","relation":{},"ISSN":["0217-5959","1793-7019"],"issn-type":[{"value":"0217-5959","type":"print"},{"value":"1793-7019","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}