{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:48Z","timestamp":1759847208320},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00377-9","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"122-133","source":"Crossref","is-referenced-by-count":15,"title":["The general routing polyhedron: A unifying framework"],"prefix":"10.1016","volume":"112","author":[{"given":"Adam N","family":"Letchford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00377-9_BIB1","unstructured":"Applegate, D., Bixby, R.E., Chv\u00e1tal, V., Cook, W., 1995. Finding cuts in the TSP, DIMACS Technical Report 95-05, Bell Communications Research, Morristown, NJ, 07690, USA"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/moor.16.2.259","article-title":"Small travelling salesman polytopes","volume":"16","author":"Boyd","year":"1991","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB3","unstructured":"Caprara, A., Fischetti, M., Letchford, A.N., 1997. On the separation of maximally violated mod-k cuts, Technical Report OR-97-8, DEIS, University of Bologna"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB4","unstructured":"Corber\u00e1n, A. (1997). Private communication"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(94)90398-0","article-title":"A polyhedral approach to the rural postman problem","volume":"79","author":"Corber\u00e1n","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB6","unstructured":"Corber\u00e1n, A., Sanchis, J.M., 1996. The general routing problem polyhedron: facets from the RPP and GTSP polyhedra. Eur. J. Oper. Res., to appear"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","article-title":"The travelling salesman on a graph and some related integer polyhedra","volume":"33","author":"Cornu\u00e9jols","year":"1985","journal-title":"Math. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0-1 vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB9","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matchings, Euler tours and the Chinese postman problem","volume":"5","author":"Edmonds","year":"1973","journal-title":"Math. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems, part 2: the rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB11","doi-asserted-by":"crossref","unstructured":"Fleischer, L., Tardos, E., 1996. Separating maximally violated comb inequalities in planar graphs, Technical Report TR-1150, School of Oper. Res. Ind. Eng., Cornell University","DOI":"10.1007\/3-540-61310-2_35"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","article-title":"A cutting-plane procedure for the travelling salesman problem on a road network","volume":"21","author":"Fleischmann","year":"1985","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB13","doi-asserted-by":"crossref","unstructured":"Fleischmann, B., 1987. Cutting-planes for the symmetric travelling salesman problem, Research Report, Hamburg University","DOI":"10.1007\/978-3-642-73778-7_162"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB14","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. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","article-title":"On the symmetric travelling salesman problem I: inequalities","volume":"16","author":"Gr\u00f6tschel","year":"1979","journal-title":"Math. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_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":"Gr\u00f6tschel","year":"1986","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB17","doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G., 1995. The travelling salesman problem. In: Ball, M.O., Magnanti, T.L., Monma C.L., Nemhauser, G.L. (Eds.), Network Models, Handbooks on Ops Research and Man. Science, vol. 7. Elsevier, Amsterdam","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB18","unstructured":"J\u00fcnger, M., Reinelt, G., Rinaldi, G., 1997. The travelling salesman problem. In: Dell'Amico, M., Maffioli, F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, New York"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB19","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.3230060305","article-title":"On general routing problems","volume":"6","author":"Lenstra","year":"1976","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0377-2217(96)00346-3","article-title":"New inequalities for the general routing problem","volume":"96","author":"Letchford","year":"1997","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB21","doi-asserted-by":"crossref","unstructured":"Naddef, D., 1990. Handles and teeth in the symmetric travelling salesman polytope. In: Cook, W., Seymour, P.D. (Eds.), Polyhedral combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 1. AMS, Providence, RJ","DOI":"10.1090\/dimacs\/001\/07"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB22","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/moor.17.4.882","article-title":"The binested inequalities for the symmetric travelling salesman polytope","volume":"17","author":"Naddef","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB23","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":"Naddef","year":"1991","journal-title":"Math. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB24","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01581259","article-title":"The graphical relaxation: a new framework for the symmetric travelling salesman polytope","volume":"58","author":"Naddef","year":"1992","journal-title":"Math. Prog."},{"key":"10.1016\/S0377-2217(97)00377-9_BIB25","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A., 1988. Integer and Combinatorial Optimisation. Wiley, New York","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB26","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1002\/net.3230040105","article-title":"A fundamental problem in vehicle routing","volume":"4","author":"Orloff","year":"1974","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(97)00377-9_BIB27","first-page":"78","article-title":"On the symmetric travelling salesman problem: a computational study","volume":"12","author":"Padberg","year":"1980","journal-title":"Math. Prog."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,12]],"date-time":"2020-01-12T23:43:15Z","timestamp":1578872595000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003779"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00377-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}