{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:43Z","timestamp":1759063843450},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9390,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90015-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"119-136","source":"Crossref","is-referenced-by-count":4,"title":["Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms"],"prefix":"10.1016","volume":"18","author":[{"given":"Ruy Eduardo","family":"Campello","sequence":"first","affiliation":[]},{"given":"Nelson F.","family":"Maculan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90015-1_BIB1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0167-5060(08)70725-8","article-title":"Some valid inequalities for the set partitioning problem","volume":"1","author":"Balas","year":"1977","journal-title":"Discrete Math."},{"issue":"4","key":"10.1016\/0166-218X(87)90015-1_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/1018115","article-title":"Set partitioning: A survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Review"},{"issue":"1","key":"10.1016\/0166-218X(87)90015-1_BIB3","first-page":"75","article-title":"Updating a hybrid algorithm for set partitioning problem","volume":"4","author":"Campello","year":"1985","journal-title":"Comput. Appl. Math."},{"key":"10.1016\/0166-218X(87)90015-1_BIB4","series-title":"Technical Report ES-51\/85","article-title":"An O(n3) worst case bounded special LP knapsack (0\u20131) with two constraints","author":"Campello","year":"1985"},{"key":"10.1016\/0166-218X(87)90015-1_BIB5","first-page":"79","article-title":"A geometric approach to two-constraint linear programs with generalized upper bounds","volume":"Vol. 1","author":"Dyer","year":"1983"},{"key":"10.1016\/0166-218X(87)90015-1_BIB6","article-title":"Contribution \u00e0 la r\u00e9solution du probl\u00e8me de recouvrement: M\u00e9thodes de troncature","volume":"VI","author":"D\u00e9lorme","year":"1974"},{"issue":"1","key":"10.1016\/0166-218X(87)90015-1_BIB7","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."},{"issue":"1","key":"10.1016\/0166-218X(87)90015-1_BIB8","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","article-title":"Formulations and algorithms for the capacitated minimal directed tree problem","volume":"30","author":"Gavisch","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90015-1_BIB9","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. Programming Study"},{"key":"10.1016\/0166-218X(87)90015-1_BIB10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01588255","article-title":"A O(n log n) algorithm for LP knapsacks with GUB constraints","volume":"17","author":"Glover","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90015-1_BIB11","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programming"},{"issue":"1","key":"10.1016\/0166-218X(87)90015-1_BIB12","first-page":"13","article-title":"Un probl\u00e8me de recouvrement exact: l'Habillage des horaires d'une ligne autobus","author":"Heurgon","year":"1972","journal-title":"Rev. Fran\u00e7aise Automat. Informat. Rech. Op\u00e9r."},{"issue":"1","key":"10.1016\/0166-218X(87)90015-1_BIB13","first-page":"18","volume":"1","author":"Johnson","year":"1981","journal-title":"A note on the knapsack problem with special ordered sets, Oper. Res. Lett."},{"key":"10.1016\/0166-218X(87)90015-1_BIB14","series-title":"Optimization Theory for Large Systems","author":"Lasdon","year":"1970"},{"issue":"4","key":"10.1016\/0166-218X(87)90015-1_BIB15","first-page":"315","article-title":"Relaxation Lagrangienne: le Probl\u00e8me du knapsack 0\u20131, INFOR","volume":"21","author":"Maculan","year":"1983","journal-title":"Canad. J. Oper. Res. Inform. Process."},{"key":"10.1016\/0166-218X(87)90015-1_BIB16","series-title":"Recent Advances in Mathematical Programming","first-page":"311","article-title":"An accelerated euclidean algorithm for integer linear programming","author":"Martin","year":"1963"},{"issue":"5","key":"10.1016\/0166-218X(87)90015-1_BIB17","first-page":"774","volume":"20","author":"Marsten","year":"1974","journal-title":"An algorithm for large set partitioning problems, Management Sci."},{"key":"10.1016\/0166-218X(87)90015-1_BIB18","first-page":"217","volume":"7","author":"Muller","year":"1978","journal-title":"Finding the intersection of two convex polyhedra, Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(87)90015-1_BIB19","series-title":"Convex Analysis","author":"Rockaffellar","year":"1970"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:04:50Z","timestamp":1580882690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900151"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90015-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}