{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:01:26Z","timestamp":1704931286305},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90058-y","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"531-535","source":"Crossref","is-referenced-by-count":1,"title":["An improved bounding procedure for the constrained assignment problem"],"prefix":"10.1016","volume":"18","author":[{"given":"Moshe B.","family":"Rosenwein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90058-Y_BIB1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","article-title":"Resource-constrained assignment scheduling","volume":"34","author":"Mazzola","year":"1986","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90058-Y_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(91)90058-Y_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 pressurised water reactors","volume":"8","author":"Gupta","year":"1981","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0305-0548(85)90011-5","article-title":"A Lagrangean-relaxation method for the constrained assignment problem","volume":"12","author":"Aggarwal","year":"1985","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB5","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(91)90058-Y_BIB6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation for integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Math. Program. Study"},{"key":"10.1016\/0305-0548(91)90058-Y_BIB7","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","article-title":"Lagrangean decomposition: a model yielding stronger Lagrangean bounds","volume":"39","author":"Guignard","year":"1987","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580728","article-title":"Layering strategies for creating exploitable structures in linear and integer programs","volume":"40","author":"Glover","year":"1988","journal-title":"Math. Program."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB9","article-title":"Design and application of solution methodologies to optimize problems in transportation logistics","author":"Rosenwein","year":"1986"},{"key":"10.1016\/0305-0548(91)90058-Y_BIB10","article-title":"The potential of Lagrangean decomposition","author":"Guignard","year":"1989"},{"key":"10.1016\/0305-0548(91)90058-Y_BIB11","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03004231","article-title":"Plus courts chemins avec constraintes: algorithmes et applications","volume":"30","author":"Minoux","year":"1975","journal-title":"Ann. T\u00e9l\u00e9commun."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"A dual algorithm for the constrained shortest path problem","volume":"10","author":"Handler","year":"1980","journal-title":"Networks"},{"key":"10.1016\/0305-0548(91)90058-Y_BIB13","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1145\/321724.321734","article-title":"Accelerated algorithms for labeling and relabeling of trees with applications to distribution problems","volume":"19","author":"Srinivasan","year":"1972","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB14","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1145\/321752.321754","article-title":"Benefit-cost analysis of coding techniques for the primal transportation algorithm","volume":"20","author":"Srinivasan","year":"1973","journal-title":"J. Ass. Comput. Mach."},{"key":"10.1016\/0305-0548(91)90058-Y_BIB15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","article-title":"An algorithm for the solution of the 0\u20131 knapsack problem","volume":"28","author":"Fayard","year":"1982","journal-title":"Computing"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190058Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190058Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,10]],"date-time":"2024-01-10T05:49:04Z","timestamp":1704865744000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489190058Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["030505489190058Y"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90058-y","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}