{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:13:58Z","timestamp":1768709638092,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T00:00:00Z","timestamp":1294876800000},"content-version":"vor","delay-in-days":4729,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0377-2217(97)00034-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"216-223","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":23,"title":["Efficient cuts in Lagrangean \u2018Relax-and-cut\u2019 schemes"],"prefix":"10.1016","volume":"105","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00034-9_BIB1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(91)90265-W","article-title":"A facet generation and relaxation technique applied to an assignment problem with side constraints","volume":"50","author":"Aboudi","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB2","series-title":"GAMS Release 2.25: A user's guide","author":"Brooke","year":"1992"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB3","first-page":"219","article-title":"A Lagrangean relax-and-cut approach for the sequential ordering problem with precedence relationships","volume":"50","author":"Escudero","year":"1994"},{"issue":"1","key":"10.1016\/S0377-2217(97)00034-9_BIB4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1287\/moor.16.1.42","article-title":"Facets of the asymmetric traveling salesman problem","volume":"16","author":"Fischetti","year":"1991","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB5","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","article-title":"Lagrangean relaxation and its uses in integer programming","volume":"2","author":"Geoffrion","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB7","series-title":"Presentation at INFORMS Meeting","article-title":"On the use of Lagrangean relaxation and penalties within branch-and-bound","author":"Guignard","year":"1997"},{"issue":"4","key":"10.1016\/S0377-2217(97)00034-9_BIB8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1287\/opre.37.4.658","article-title":"An improved dual-based algorithm for the generalized assignment problem","volume":"37","author":"Guignard","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB9","article-title":"A 2-phase dual method for solving Lagrangean duals","author":"Guignard","year":"1994","journal-title":"Department of OPIM Report 94-10-03"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB10","series-title":"Proceedings of the VII CLAIO","first-page":"399","article-title":"A hybrid algorithm for solving Lagrangean duals in mixed integer programming","author":"Guignard","year":"1994"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB11","first-page":"192","article-title":"The asymmetric traveling salesman problem and spanning arborescences of directed graphs","volume":"25","author":"Hong","year":"1976","journal-title":"Methods of Operations Research"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB12","article-title":"A strengthened Lagrangean approach to the traveling salesman problem","author":"Malik","year":"1992","journal-title":"Department of Decision Sc. Report 92-01-11"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB13","series-title":"Proceedings of the 9th IFORS Conference","first-page":"589","article-title":"An algorithm for the generalized assignment problem","author":"Martello","year":"1981"},{"key":"10.1016\/S0377-2217(97)00034-9_BIB14","article-title":"Parametric Integer Programming","author":"Nauss","year":"1974"},{"issue":"1","key":"10.1016\/S0377-2217(97)00034-9_BIB15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch-and-bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797000349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T22:34:45Z","timestamp":1759790085000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797000349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0377221797000349"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00034-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient cuts in Lagrangean \u2018Relax-and-cut\u2019 schemes","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0377-2217(97)00034-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}