{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:42:54Z","timestamp":1752460974571},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0305-0548(85)90011-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"97-106","source":"Crossref","is-referenced-by-count":25,"title":["A Lagrangean-relaxation method for the constrained assignment problem"],"prefix":"10.1016","volume":"12","author":[{"given":"Vijay","family":"Aggarwal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(85)90011-5_BIB1","series-title":"Combinational Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0305-0548(85)90011-5_BIB2","first-page":"417","article-title":"An algorithm for optimal reloading of pressurized water reactors","volume":"Vol 72","author":"Brans","year":"1973"},{"key":"10.1016\/0305-0548(85)90011-5_BIB3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(81)90013-7","article-title":"Tree search method for optimal core management of pressurized water reactors","volume":"8","author":"Gupta","year":"1981","journal-title":"Comput. Ops. Res."},{"key":"10.1016\/0305-0548(85)90011-5_BIB4","series-title":"Combination Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0305-0548(85)90011-5_BIB5","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1287\/opre.16.3.682","article-title":"An algorithm for ranking all the assignments in order of increasing cost","volume":"16","author":"Murty","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/0305-0548(85)90011-5_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangean relaxation method for solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Sci."},{"key":"10.1016\/0305-0548(85)90011-5_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","article-title":"Minimal spanning tree subject to a side constraint","volume":"9","author":"Aggarwal","year":"1982","journal-title":"Comput. Ops. Res."},{"key":"10.1016\/0305-0548(85)90011-5_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","article-title":"The alternating basis algorithm for assignment problems","volume":"13","author":"Barr","year":"1977","journal-title":"Meth. Prog."},{"key":"10.1016\/0305-0548(85)90011-5_BIB9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/BF01584237","article-title":"A new algorithm for the assignment problem","volume":"21","author":"Bertsekas","year":"1981","journal-title":"Math. Prog."},{"key":"10.1016\/0305-0548(85)90011-5_BIB10","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":"Oper. Res."},{"key":"10.1016\/0305-0548(85)90011-5_BIB11","article-title":"A dual algorithm for the constrained assignment problem with an application to core management of PWR","author":"Aggarwal","year":"1983","journal-title":"WSU Technical Report"},{"key":"10.1016\/0305-0548(85)90011-5_BIB12","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/0305-0548(85)90011-5_BIB13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/net.3230070405","article-title":"Minimal ratio spanning tree","volume":"7","author":"Chandrasekaran","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(85)90011-5_BIB14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0377-2217(83)90312-0","article-title":"The assignment problem under categorized jobs","volume":"14","author":"Aggarwal","year":"1983","journal-title":"Euro. J. Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054885900115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:51:29Z","timestamp":1552913489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054885900115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0305054885900115"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(85)90011-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}