{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:24Z","timestamp":1774449084994,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01584228","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:29:50Z","timestamp":1114676990000},"page":"19-46","source":"Crossref","is-referenced-by-count":111,"title":["A restricted Lagrangean approach to the traveling salesman problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicos","family":"Christofides","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0120885","volume":"12","author":"E. Balas","year":"1980","unstructured":"E. Balas, \u201cCutting planes from conditional bounds: A new approach to set covering\u201d,Mathematical Programming Studies 12 (1980) 19\u201336.","journal-title":"Mathematical Programming Studies"},{"key":"CR2","unstructured":"E. Balas and N. Christofides, \u201cA new penalty method for the traveling salesman problem\u201d, Paper presented at the Ninth International Symposium on Mathematical Programming, Budapest, August 1976."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1287\/opre.19.2.278","volume":"19","author":"M. Bellmore","year":"1971","unstructured":"M. Bellmore and J.C. Malone, \u201cPathology of traveling salesman subtour elimination algorithms\u201d,Operations Research 19 (1971) 278\u2013307.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","volume":"16","author":"M. Bellmore","year":"1968","unstructured":"M. Bellmore and G.L. Nemhauser, \u201cThe traveling salesman problem: A survey\u201d,Operations Research 16 (1968) 538\u2013558.","journal-title":"Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0167-5060(08)70827-6","volume":"4","author":"R.E. Burkard","year":"1979","unstructured":"R.E. Burkard, \u201cTraveling salesman and assignment problems: A survey\u201d,Annals of Discrete Mathematics 4 (1979) 193\u2013217.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1137\/0119070","volume":"19","author":"N. Christofides","year":"1970","unstructured":"N. Christofides, \u201cThe shortest hamiltonian chain of a graph\u201d,SIAM Journal of Applied Mathematics 19 (1970) 689\u2013696.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1044","DOI":"10.1287\/opre.20.5.1044","volume":"20","author":"N. Christofides","year":"1972","unstructured":"N. Christofides, \u201cBounds for the traveling salesman problem\u201d,Operations Research 20 (1972) 1044\u20131055.","journal-title":"Operations Research"},{"key":"CR8","volume-title":"Graph theory: An algorithmic approach","author":"N. Christofides","year":"1976","unstructured":"N. Christofides,Graph theory: An algorithmic approach (Academic Press, New York, 1976)."},{"key":"CR9","first-page":"131","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"N. Christofides, \u201cThe traveling salesman problem\u201d, in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi,Combinatorial Optimization (Wiley, New York, 1979) pp. 131\u2013150."},{"key":"CR10","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, D.R. Fulkerson and S. Johnson, \u201cSolution of a large scale traveling salesman problem\u201d,Operations Research 2 (1954) 393\u2013410.","journal-title":"Operations Research"},{"key":"CR11","unstructured":"W.L. Eastman, \u201cLinear programming with pattern constraints\u201d, Unpublished Ph.D. Dissertation, Harvard University, 1958."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01585505","volume":"7","author":"K.H. Hansen","year":"1974","unstructured":"K.H. Hansen and J. Krarup, \u201cImprovements of the Held\u2014Karp algorithm for the symmetric traveling salesman problem\u201d,Mathematical Programming 7 (1974) 87\u201396.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R. Karp, \u201cThe traveling salesman problem and minimum spanning trees\u201d,Operations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R. Karp, \u201cThe traveling salesman problem and minimum spanning trees, II\u201d,Mathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.5.1.1","volume":"5","author":"V. Klee","year":"1980","unstructured":"V. Klee, \u201cCombinatorial optimization: What is the state of the art\u201d,Mathematics of Operations Research 5 (1980) 1\u201326.","journal-title":"Mathematics of Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"272","DOI":"10.15807\/jorsj.19.272","volume":"19","author":"H. Kubo","year":"1976","unstructured":"H. Kubo and N. Okino, \u201cA new practical solution for large traveling salesman problems\u201d,Journal of the Operations Research Society of Japan 19 (1976) 272\u2013285 [In Japanese.]","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR17","volume-title":"Algorithms for the solution of the optimal cost and bottleneck traveling salesman problem","author":"D.M. Shapiro","year":"1966","unstructured":"D.M. Shapiro, \u201cAlgorithms for the solution of the optimal cost and bottleneck traveling salesman problem\u201d, Unpublished Sc.D. Thesis, Washington University, St. Louis, 1966."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/S0167-5060(08)70755-6","volume":"1","author":"T.C.H. Smith","year":"1977","unstructured":"T.C.H. Smith and G.L. Thompson, \u201cComputational performance of three subtour elimination algorithms for asymmetric traveling salesman problems\u201d,Annals of Discrete Mathematics 1 (1977) 495\u2013506.","journal-title":"Annals of Discrete Mathematics"},{"key":"CR19","unstructured":"Computer Review, GML Corp., Lexington, MA (1979)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584228.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584228\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:28Z","timestamp":1556897368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01584228"],"URL":"https:\/\/doi.org\/10.1007\/bf01584228","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}