{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:48:57Z","timestamp":1710269337729},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1007\/s10878-005-1777-9","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T10:09:50Z","timestamp":1124532590000},"page":"357-379","source":"Crossref","is-referenced-by-count":9,"title":["The 2-Edge-Connected Subgraph Polyhedron"],"prefix":"10.1007","volume":"9","author":[{"given":"Dieter","family":"Vandenbussche","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1777_CR1","unstructured":"D. Applegate, R. Bixby, V. Chv\u00e1tal, and W. Cook, \u201cConcorde: A code for solving traveling salesman problems,\u201d http:\/\/www.tsp.gatech.edu\/concorde.html."},{"key":"1777_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","volume":"147","author":"F. Barahona","year":"1995","unstructured":"F. Barahona and A.R. Mahjoub, \u201cOn two-connected subgraph polytopes,\u201d Discrete Math., vol. 147, pp. 19\u201334, 1995.","journal-title":"Discrete Math."},{"key":"1777_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/moor.16.2.259","volume":"16","author":"S.C. Boyd","year":"1991","unstructured":"S.C. Boyd and W.H. Cunningham, \u201cSmall traveling salesman polytopes,\u201d Math. Oper. Res., vol. 16, no. 2, pp. 259\u2013271, 1991.","journal-title":"Math. Oper. Res."},{"key":"1777_CR4","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1137\/0406047","volume":"6","author":"S.C. Boyd","year":"1993","unstructured":"S.C. Boyd and T. Hao, \u201cAn integer polytope related to the design of survivable communication networks,\u201d SIAM J. Discrete Math., vol. 6, no. 4, pp. 612\u2013630, 1993.","journal-title":"SIAM J. Discrete Math."},{"key":"1777_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/jgt.3190030103","volume":"3","author":"G. Chaty","year":"1979","unstructured":"G. Chaty and M. Chein, \u201cMinimally 2-edge-connected graphs,\u201d J. Graph Theory, vol. 3, pp. 15\u201322, 1979.","journal-title":"J. Graph Theory"},{"key":"1777_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S0895480191222665","volume":"7","author":"S. Chopra","year":"1994","unstructured":"S. Chopra, \u201cThe k-edge-connected spanning subgraph polyhedron,\u201d SIAM J. Discrete Math., vol. 7, no. 2, pp. 245\u2013259, 1994.","journal-title":"SIAM J. Discrete Math."},{"key":"1777_CR7","unstructured":"T. Christof and A. L\u00f3bel, \u201cPORTA: A polyhedron representation transformation algorithm,\u201d http:\/\/www.zib.de\/Optimization\/Software\/Porta\/, 1997."},{"key":"1777_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"G. Cornu\u00e9jols, J. Fonlupt, and D. Naddef, \u201cThe travelling salesman problem on a graph and some related integer polyhedra,\u201d Math. Prog., vol. 33, pp. 1\u201327, 1985.","journal-title":"Math. Prog."},{"key":"1777_CR9","first-page":"166","volume-title":"Integer Programming and Combinatorial Optimization, volume 1610 of lecture notes in Comput. Sci.","author":"J. Fonlupt","year":"1999","unstructured":"J. Fonlupt and A.R. Mahjoub, \u201cCritical extreme points of the 2-edge connected spanning subgraph polytope,\u201d in Integer Programming and Combinatorial Optimization, volume 1610 of lecture notes in Comput. Sci., Springer, Berlin, 1999, pp. 166\u2013182."},{"key":"1777_CR10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01585700","volume":"53","author":"J. Fonlupt","year":"1992","unstructured":"J. Fonlupt and D. Naddef, \u201cThe travelling salesman problem in graphs with some excluded minors,\u201d Math. Prog., vol. 53, no. 2, pp. 147\u2013172, 1992.","journal-title":"Math. Prog."},{"key":"1777_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M.W. Padberg, \u201cOn the symmetric travelling salesman problem I: Inequalities,\u201d Math. Prog., vol. 16, no. 3, pp. 265\u2013280, 1979.","journal-title":"Math. Prog."},{"key":"1777_CR12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"M. Gr\u00f6tschel and W.R. Pulleyblank, \u201cClique tree inequalities and the symmetric travelling salesman problem,\u201d Math. Oper. Res., vol. 11, no. 4, pp. 537\u2013569, 1986.","journal-title":"Math. Oper. Res."},{"key":"1777_CR13","first-page":"617","volume-title":"Network Models, volume 7 of Handbooks Oper. Res. Management Sci.","author":"M. Gr\u00f3tschel","year":"1995","unstructured":"M. Gr\u00f3tschel, C.L. Monma, and M. Stoer, \u201cDesign of survivable networks,\u201d in Network Models, volume 7 of Handbooks Oper. Res. Management Sci., North-Holland, Amsterdam, 1995, pp. 617\u2013672."},{"key":"1777_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"A.R. Mahjoub","year":"1994","unstructured":"A.R. Mahjoub. \u201cTwo-edge connected spanning subgraphs and polyhedra,\u201d Math. Prog., vol. 64, no. 2, pp. 199\u2013208, 1994.","journal-title":"Math. Prog."},{"key":"1777_CR15","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(96)00004-0","volume":"170","author":"A.R. Mahjoub","year":"1997","unstructured":"A.R. Mahjoub, \u201cOn perfectly two-edge connected graphs,\u201d Discrete Math., vol. 170, no. 1\u20133, pp. 153\u2013172, 1997.","journal-title":"Discrete Math."},{"key":"1777_CR16","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/moor.17.4.882","volume":"17","author":"D. Naddef","year":"1992","unstructured":"D. Naddef, \u201cThe binested inequalities for the symmetric travelling salesman polytope,\u201d Math. Oper. Res., vol. 17, no. 4, pp. 882\u2013900, 1992.","journal-title":"Math. Oper. Res."},{"key":"1777_CR17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1992","unstructured":"D. Naddef and G. Rinaldi, \u201cThe graphical relaxation: A new framework for the symmetric travelling salesman polytope,\u201d Math. Prog., vol. 58, no. 1, pp. 53\u201388, 1992.","journal-title":"Math. Prog."},{"key":"1777_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s101070100275","volume":"92","author":"D. Naddef","year":"2002a","unstructured":"D. Naddef and S. Thienel, \u201cEfficient separation routines for the symmetric traveling salesman problem. I. general tools and comb separation,\u201d Math. Program., vol. 92 no. 2, Ser. A, pp. 237\u2013255, 2002a.","journal-title":"Math. Program."},{"key":"1777_CR19","doi-asserted-by":"crossref","unstructured":"D. Naddef and S. Thienel, \u201cEfficient separation routines for the symmetric traveling salesman problem. II. Separating multi handle inequalities,\u201d Math. Program., vol. 92, no. 2, Ser. A, 2002b.","DOI":"10.1007\/s101070100276"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1777-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1777-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1777-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T04:28:07Z","timestamp":1586406487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1777-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["1777"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1777-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}