{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:47:16Z","timestamp":1648892836441},"reference-count":27,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0167-6377(95)00038-0","type":"journal-article","created":{"date-parts":[[2003,11,6]],"date-time":"2003-11-06T11:08:40Z","timestamp":1068116920000},"page":"177-184","source":"Crossref","is-referenced-by-count":1,"title":["Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies"],"prefix":"10.1016","volume":"18","author":[{"given":"Agha Iqbal","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirley","family":"Shmerling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00038-0_BIB1","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1080\/00207728808964068","article-title":"Graphical-structure-based models for routing problems","volume":"19","author":"Ali","year":"1988","journal-title":"Internat. J Systems Sci."},{"key":"10.1016\/0167-6377(95)00038-0_BIB2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(86)90087-9","article-title":"The asymmetric mtravelling salesmen problem: a duality based branch-andbound algorithm","volume":"13","author":"Ali","year":"1986","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-6377(95)00038-0_BIB3","series-title":"Working paper","article-title":"A graphical-construct-based algorithm for optimal solutions to a Lagrangian dual of the Hamiltonian path problem","author":"Ali","year":"1993"},{"key":"10.1016\/0167-6377(95)00038-0_BIB4","unstructured":"E. Balas and P. Toth, \u201cBranch and bound methods\u201d, in: Lawler et al. (eds.), The Travelling Salesman Problem, pp. 371\u2013378."},{"key":"10.1016\/0167-6377(95)00038-0_BIB5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01588786","article-title":"Optimizing over the subtour polytope of the travelling salesman problem","volume":"49","author":"Boyd","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB6","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","article-title":"Solving large-scale travelling salesman problem to optimality","volume":"26","author":"Crowder","year":"1980","journal-title":"Manage. Sci."},{"key":"10.1016\/0167-6377(95)00038-0_BIB7","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solutions of a large-scale travelling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB8","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1287\/opre.7.1.58","article-title":"On a linear-programming, combinatorial approach to the travelling salesman problem","volume":"7","author":"Dantzig","year":"1959","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01580734","article-title":"A new class of cutting planes for the symmetric travelling salesman problem","volume":"40","author":"Fleischmann","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB10","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1287\/opre.34.5.698","article-title":"An optimal solution method for large-scale multiple travelling salesmen problems","volume":"34","author":"Gavish","year":"1986","journal-title":"Open. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB11","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","article-title":"On the symmetric travelling salesman problem: solution of a 120-city problem","volume":"12","author":"Grotschel","year":"1980","journal-title":"Math. Programming Studv"},{"key":"10.1016\/0167-6377(95)00038-0_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02239975","article-title":"A cutting plane algorithm for minimum perfect 2-matchings","volume":"39","author":"Grotschel","year":"1987","journal-title":"Computing"},{"key":"10.1016\/0167-6377(95)00038-0_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","article-title":"Solutions of large-scale travelling salesman problems","volume":"51","author":"Grotschel","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","article-title":"On the symmetric travelling salesman problem 1: inequalities","volume":"16","author":"Grotschel","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB15","series-title":"The Travelling Salesman Problem","first-page":"251","article-title":"Polyhedral theory","author":"Grotschel","year":"1985"},{"key":"10.1016\/0167-6377(95)00038-0_BIB16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","article-title":"Clique tree inequalities and the symmetric travelling salesman problem","volume":"11","author":"Grotschel","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","article-title":"Improvements of the Held-Karp algorithm for the symmetric travelling salesman problem","volume":"7","author":"Helbig Hansen","year":"1974","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB18","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The travelling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB19","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The travelling salesman problem and minimum spanning trees: part 11","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","article-title":"A heuristic approach to solving travelling salesman problems","volume":"10","author":"Karg","year":"1964","journal-title":"Manage. Sci."},{"key":"10.1016\/0167-6377(95)00038-0_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(90)90033-2","article-title":"A dual Ascent algorithm for the 1-tree relaxation of the symmetric travelling salesman problem","volume":"9","author":"Malik","year":"1990","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(95)00038-0_BIB22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01586945","article-title":"The symmetric travelling salesman polytope and its graphical relaxation: composition of valid inequalities","volume":"51","author":"Nadef","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(95)00038-0_BIB23","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0167-6377(95)00038-0_BIB24","series-title":"The Travelling Salesman Problem","first-page":"307","article-title":"Polyhedral computations","author":"Padberg","year":"1995"},{"key":"10.1016\/0167-6377(95)00038-0_BIB25","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","article-title":"On the symmetric travelling salesman problem: a computational study","volume":"12","author":"Padberg","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0167-6377(95)00038-0_BIB26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1287\/moor.7.1.67","article-title":"Odd minimum cut-sets and b-matchings","volume":"7","author":"Padberg","year":"1982","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)00038-0_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city travelling salesman problem by branch and cut","volume":"6","author":"Padberg","year":"1987","journal-title":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637795000380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T04:54:16Z","timestamp":1550379256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637795000380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0167637795000380"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00038-0","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}