{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:25:05Z","timestamp":1780727105506,"version":"3.54.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"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":[[1979,12]]},"DOI":"10.1007\/bf01582117","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:28:41Z","timestamp":1114662521000},"page":"281-302","source":"Crossref","is-referenced-by-count":90,"title":["On the symmetric travelling salesman problem II: Lifting theorems and facets"],"prefix":"10.1007","volume":"16","author":[{"given":"Martin","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred W.","family":"Padberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal, \u201cEdmonds polytopes and weakly Hamiltonian graphs\u201d,Mathematical Programming 5 (1973) 29\u201340.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"M. Gr\u00f6tschel, \u201cPolyedrische Charakterisierungen kombinatorischer Optimierungsprobleme\u201d, Dissertation, University of Bonn, 1977 (Verlag A. Hain, Meisenheim, 1977)."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel and M.W. Padberg, \u201cOn the symmetric travelling salesman problem I: Inequalities\u201d,Mathematical Programming (1979) 265\u2013280 (this issue).","DOI":"10.1007\/BF01582116"},{"key":"CR4","volume-title":"Polytopes \u00e0 sommets dans [0, 1] n","author":"J.F. Maurras","year":"1976","unstructured":"J.F. Maurras, \u201cPolytopes \u00e0 sommets dans [0, 1] n \u201d, Th\u00e8se, University of Paris (Paris, 1976)."},{"key":"CR5","volume-title":"On the symmetric travelling salesman problem: A computational study","author":"M.W. Padberg","year":"1977","unstructured":"M.W. Padberg and S. Hong, \u201cOn the symmetric travelling salesman problem: A computational study\u201d, T.J. Watson Research Center, IBM Research (Yorktown Heights, NY, 1977)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582117.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582117\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:45Z","timestamp":1556882145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01582117"],"URL":"https:\/\/doi.org\/10.1007\/bf01582117","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}