{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,18]],"date-time":"2024-07-18T11:14:57Z","timestamp":1721301297411},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0167-6377(02)00182-7","type":"journal-article","created":{"date-parts":[[2002,10,16]],"date-time":"2002-10-16T21:46:23Z","timestamp":1034804783000},"page":"265-268","source":"Crossref","is-referenced-by-count":14,"title":["Separation of partition inequalities for the (1,2)-survivable network design problem"],"prefix":"10.1016","volume":"30","author":[{"given":"Herv\u00e9","family":"Kerivin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Ridha","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(02)00182-7_BIB1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/moor.25.2.243.12223","article-title":"Separation of partition inequalities","volume":"25","author":"Ba\u0131̈ou","year":"2000","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(92)90045-5","article-title":"Separating from the dominant of the spanning tree polytope","volume":"12","author":"Barahona","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582573","article-title":"The Steiner tree problem I: formulations, compositions and extension of facets","volume":"64","author":"Chopra","year":"1994","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","article-title":"Optimal attack and reinforcement of a network","volume":"32","author":"Cunningham","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB5","doi-asserted-by":"crossref","unstructured":"J. Fonlupt, A.R. Mahjoub, Critical extreme points of the 2-edge connected subgraph polytope, Proceedings IPCO\u201999, Lecture Notes of Computer Science, Vol. 1610, Springer, Berlin, 1999, pp. 166\u2013183.","DOI":"10.1007\/3-540-48777-8_13"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB6","series-title":"Submodular Functions and Optimization","author":"Fujishige","year":"1991"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01580607","article-title":"Survivable networks, linear programming relaxations and the parsimonious property","volume":"60","author":"Goemans","year":"1993","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB8","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB9","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/0802024","article-title":"Facets for polyhedral arising in the design of communication networks with low-connectivity constraints","volume":"2","author":"Gr\u00f6tschel","year":"1992","journal-title":"SIAM J. Optim."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB10","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/opre.40.2.309","article-title":"Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints","volume":"40","author":"Gr\u00f6tschel","year":"1992","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB11","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma, M. Stoer, Design of survivable networks, in: M.O. Ball et al. (Eds.), Handbooks in OR & MS, Vol. 7, 1995, pp. 617\u2013671.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB12","doi-asserted-by":"crossref","unstructured":"S. Iwata, L. Fleischer, S. Fujishige. A strongly polynomial-time algorithm for minimizing submodular functions, Proceedings of the 32nd ACM Symposium on Theory of Computing (2000) J. ACM 48 (2001) 761\u2013777.","DOI":"10.1145\/502090.502096"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB13","unstructured":"H. Kerivin, R\u00e9seaux fiables et Poly\u00e8dres, Ph.D. Dissertation, Universit\u00e9 Blaise Pascal, Clermont-Ferrand, France, 2000."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB14","unstructured":"C-W. Ko, C.L. Monma, Heuristic methods for designing highly survivable communication networks, Technical Report, Bellcore, 1989."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB15","series-title":"Mathematical Programming\u2014The State of the Art","first-page":"234","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1287\/opre.37.4.531","article-title":"Methods for designing communication networks with certain two-connected survivability constraints","volume":"37","author":"Monma","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB17","unstructured":"M. Queyranne. A combinatorial algorithm for minimizing symmetric submodular function, in: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 98\u2013101."},{"key":"10.1016\/S0167-6377(02)00182-7_BIB18","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","article-title":"A combinatorial algorithm minimizing submodular functions in strongly polynomial time","volume":"80","author":"Schrijver","year":"2000","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0167-6377(02)00182-7_BIB19","article-title":"Design of survivable networks","volume":"Vol. 1531","author":"Stoer","year":"1992"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001827?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637702001827?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T14:53:01Z","timestamp":1583851981000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637702001827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0167637702001827"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(02)00182-7","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}