{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:11:00Z","timestamp":1759666260153},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0377-2217(01)00159-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:56:01Z","timestamp":1034610961000},"page":"473-483","source":"Crossref","is-referenced-by-count":4,"title":["Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems"],"prefix":"10.1016","volume":"138","author":[{"given":"Luiz Antonio N.","family":"Lorena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcelo","family":"Gon\u00e7alves Narciso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00159-X_BIB1","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1016\/S0377-2217(96)00181-6","article-title":"An adaptation of SH heuristic to the location set covering problem","volume":"100","author":"Almi\u00f1ana","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF02591740","article-title":"A generalization of Poliak's convergence results for subgradient optimization","volume":"37","author":"Allen","year":"1987","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB3","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","article-title":"On the choice of step size in subgradient optimization","volume":"7","author":"Bazaraa","year":"1981","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01585999","article-title":"A generalized subgradient method with relaxation step","volume":"71","author":"Br\u00e4nnlund","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01585170","article-title":"Convergence of some algorithms for convex minimization","volume":"62","author":"Correa","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01581647","article-title":"Calculating surrogate constraints","volume":"19","author":"Dyer","year":"1980","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(01)00159-X_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02341815","article-title":"Methods for solving nonlinear extremal problems","volume":"16","author":"Ermol'ev","year":"1966","journal-title":"Cybernetics"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","article-title":"The Lagrangian relaxation method of solving integer programming problems","volume":"27","author":"Fisher","year":"1981","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB10","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"},{"issue":"4","key":"10.1016\/S0377-2217(01)00159-X_BIB11","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","article-title":"Surrogate constraints","volume":"16","author":"Glover","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1287\/opre.23.3.434","article-title":"Surrogate constraints duality in mathematical programming","volume":"23","author":"Glover","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB13","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On convergence rates of subgradient optimization methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB14","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1287\/opre.18.5.924","article-title":"Surrogate mathematical programming","volume":"18","author":"Greenberg","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB15","doi-asserted-by":"crossref","first-page":"193","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\/S0377-2217(01)00159-X_BIB16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","article-title":"Improvements of the Held\u2013Karp algorithm for the symmetric traveling salesman problem","volume":"7","author":"Helbig-Hansen","year":"1974","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB17","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB18","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: Part II","volume":"1","author":"Held","year":"1971","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB19","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":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB20","series-title":"Local Search in Combinatorial Optimization","article-title":"The traveling salesman problem: a case study in local optimization","author":"Jonhson","year":"1997"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB21","unstructured":"D.S. Johnson, L.A. McGeoch, E.E. Rothberg, Asymptotic experimental analysis for the Held\u2013Karp traveling salesman bound, in: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 341\u2013350"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB22","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01588253","article-title":"Some relationships between Lagrangian and surrogate duality in integer programming","volume":"17","author":"Karwan","year":"1979","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB23","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/02331938908843463","article-title":"Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints","volume":"20","author":"Kim","year":"1989","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(93)90020-H","article-title":"An improved subgradient method for constrained nondifferentiable optimization","volume":"14","author":"Kim","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB25","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB26","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","article-title":"Conditional subgradient optimization \u2013 theory and applications","volume":"88","author":"Larsson","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB27","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"issue":"1","key":"10.1016\/S0377-2217(01)00159-X_BIB28","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","article-title":"A surrogate heuristic for set covering problems","volume":"79","author":"Lorena","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00159-X_BIB29","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","article-title":"Relaxation heuristics for a generalized assignment problem","volume":"91","author":"Lorena","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB30","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03004231","article-title":"Plus courts chemins avec constraints: Algorithmes et applications","volume":"30","author":"Minoux","year":"1975","journal-title":"Annals of Telecommunications"},{"issue":"1","key":"10.1016\/S0377-2217(01)00159-X_BIB31","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","article-title":"Lagrangean\/surrogate relaxation for generalized assignment problem","volume":"114","author":"Narciso","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB32","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB33","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of unsmooth functionals","volume":"9","author":"Poljak","year":"1969","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB34","unstructured":"G. Reinelt, The traveling salesman problem: Computational solutions for TSP applications, Lecture Notes in Computer Science 840, Springer, Berlin, 1994"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB35","series-title":"Computing Tools for Modeling Optimization and Simulation: Interfaces in Computer Science and Operations Research","first-page":"115","article-title":"Lagrangean\/surrogate heuristics for p-median problems","author":"Senne","year":"2000"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB36","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.19.1.68","article-title":"Generalized lagrange multipliers in integer programming","volume":"19","author":"Shapiro","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00159-X_BIB37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(82)90015-7","article-title":"A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation","volume":"9","author":"Volgenant","year":"1982","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(01)00159-X_BIB38","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0377-2217(96)00214-7","article-title":"Estimating Held\u2013Karp lower bond for the geometric TSP","volume":"102","author":"Valenzuela","year":"1997","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170100159X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170100159X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T16:55:21Z","timestamp":1680713721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170100159X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S037722170100159X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00159-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}