{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:01:42Z","timestamp":1649016102827},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T00:00:00Z","timestamp":1200096000000},"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":[[2009,7]]},"DOI":"10.1007\/s10878-007-9134-9","type":"journal-article","created":{"date-parts":[[2008,1,11]],"date-time":"2008-01-11T15:06:31Z","timestamp":1200063991000},"page":"1-22","source":"Crossref","is-referenced-by-count":0,"title":["Half integer extreme points in the linear relaxation of\u00a0the\u00a02-edge-connected\u00a0subgraph\u00a0polyhedron"],"prefix":"10.1007","volume":"18","author":[{"given":"F.","family":"Bendali","sequence":"first","affiliation":[]},{"given":"J.","family":"Mailfert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,1,12]]},"reference":[{"issue":"2","key":"9134_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S0895480191222665","volume":"7","author":"S Chopra","year":"1994","unstructured":"Chopra S (1994) The k-edge-connected spanning subgraph polyhedron. SIAM J Discrete Math 7(2):245\u2013259","journal-title":"SIAM J Discrete Math"},{"key":"9134_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols G, Fonlupt J, Naddef D (1985) The traveling salesman problem on a graph and some related integer polyhedra. Math Program 33:1\u201327","journal-title":"Math Program"},{"key":"9134_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(96)00015-6","volume":"19","author":"M Didi Biha","year":"1996","unstructured":"Didi Biha M, Mahjoub AR (1996) k-edge connected polyhedra on series-parallel graphs. Oper Res Lett 19:71\u201378","journal-title":"Oper Res Lett"},{"key":"9134_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin RJ (1965) Topology of series-parallel networks. J\u00a0Math Anal Appl 10:303\u2013318","journal-title":"J\u00a0Math Anal Appl"},{"key":"9134_CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01585700","volume":"53","author":"J Fonlupt","year":"1992","unstructured":"Fonlupt J, Naddef D (1992) The traveling salesman problem in graphs with some excluded minors. Math Program 53:147\u2013172","journal-title":"Math Program"},{"key":"9134_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9134_CR7","series-title":"Dimacs series","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1090\/dimacs\/005\/08","volume-title":"Reliability of computer and communication networks","author":"M Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel M, Monma CL, Stoer M (1991) Polyhedral approches to network survivability. In: Roberts F, Hwang F, Monma CL (eds) Reliability of computer and communication networks. Dimacs series, vol\u00a05. AMS\/ACM, New York, pp\u00a0121\u2013141"},{"key":"9134_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.20072","volume":"46","author":"H Kerivin","year":"2005","unstructured":"Kerivin H, Mahjoub AR (2005) Design of survivable networks: a survey. Networks 46:1\u201321","journal-title":"Networks"},{"key":"9134_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0012-365X(96)00004-0","volume":"170","author":"AR Mahjoub","year":"1997","unstructured":"Mahjoub AR (1997) On perfectly two-edge connected graphs. Discrete Math 170:153\u2013172","journal-title":"Discrete Math"},{"key":"9134_CR10","series-title":"Lectures notes in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0088963","volume-title":"Design of survivable networks","author":"M Stoer","year":"1992","unstructured":"Stoer M (1992) Design of survivable networks. Lectures notes in mathematics, vol. 1531. Springer, Berlin"},{"key":"9134_CR11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10878-005-1777-9","volume":"9","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche D, Nemhauser GL (2005) The 2-edge-connected subgraph polyhedron. J Comb Optim 9:357\u2013379","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9134-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9134-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9134-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9134-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,12]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9134"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9134-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,12]]}}}