{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T12:38:00Z","timestamp":1722515880586},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T00:00:00Z","timestamp":1110758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,1]]},"DOI":"10.1007\/s10107-005-0576-5","type":"journal-article","created":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T18:09:56Z","timestamp":1110823796000},"page":"85-111","source":"Crossref","is-referenced-by-count":25,"title":["Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut"],"prefix":"10.1007","volume":"105","author":[{"given":"B.","family":"Fortz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. R.","family":"Mahjoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. T.","family":"McCormick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Pesneau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,3,14]]},"reference":[{"key":"576_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/moor.25.2.243.12223","volume":"25","author":"Ba\u00efou","year":"2","unstructured":"Ba\u00efou, M., Barahona, F., Mahjoub, A.R.: Separation of Partition Inequalities. Mathematics of Operations Research 25 (2), 243\u2013254, May 2000","journal-title":"Mathematics of Operations Research"},{"key":"576_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(92)90045-5","volume":"12","author":"Barahona","year":"1992","unstructured":"Barahona, F.: Separating from the dominant of the spanning tree polytope. Op. Research Letters 12, 201\u2013203 (1992)","journal-title":"Op. Research Letters"},{"key":"576_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(94)00255-H","volume":"147","author":"Barahona","year":"1995","unstructured":"Barahona, F., Mahjoub, A.R.: On two-connected subgraph polytopes. Discrete Mathematics 147, 19\u201334 (1995)","journal-title":"Discrete Mathematics"},{"key":"576_CR4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S0895480191222665","volume":"7","author":"Chopra","year":"1994","unstructured":"Chopra, S.: The k-edge connected spanning subgraph polyhedron. SIAM Journal on Discrete Mathematics 7, 245\u2013259 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"576_CR5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","volume":"32","author":"32","year":"1985","unstructured":"Cunningham W.H.: Optimal attack and reinforcement of a network. Journal of ACM 32, 549\u2013561 (1985)","journal-title":"Journal of ACM"},{"key":"576_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0167-6377(96)00015-6","volume":"19","author":"Biha","year":"1996","unstructured":"Didi Biha, M., Mahjoub, A.R.: k-edge connected polyhedra on series-parallel graphs. Operations Research Letters 19, 71\u201378 (1996)","journal-title":"Operations Research Letters"},{"key":"576_CR7","doi-asserted-by":"crossref","unstructured":"Fortz B.: Design of Survivable Networks with Bounded Rings. Vol. 2 Network Theory and Applications. Kluwer Academic Publishers, 2000","DOI":"10.1007\/978-1-4615-4669-6"},{"key":"576_CR8","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1287\/opre.48.6.866.12390","volume":"48","author":"Fortz","year":"6","unstructured":"Fortz, B., Labb\u00e9, M., Maffioli, F.: Solving the Two-Connected Network with Bounded Meshes Problem. Operations Research, 48 (6), 866\u2013877 November-December 2000","journal-title":"Operations Research,"},{"key":"576_CR9","first-page":"27","volume":"93","author":"(1)","year":"1","unstructured":"Fortz B., Labb\u00e9 M.: Polyhedral results for two-connected networks with bounded rings. Mathematical Programming 93 (1), 27\u201354 2002","journal-title":"Mathematical Programming"},{"key":"576_CR10","unstructured":"Fortz, B., Mahjoub, A.R., McCormick, S.T., Pesneau, P.: Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Working paper 98\/03 Institut d'Administration et de Gestion Universti\u00e9 Catholique de Louvain, Belgique, 2003"},{"key":"576_CR11","doi-asserted-by":"crossref","unstructured":"Fortz, B., Labb\u00e9, M.: Two-connected networks with rings of bounded cardinality. Computational Optimization and Applications 27, 123\u2013148 2004","DOI":"10.1023\/B:COAP.0000008649.61438.6b"},{"key":"576_CR12","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"Goldberg","year":"4","unstructured":"Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum-Flow Problem. Journal of the Association for Computing Machinery 35 (4), 921\u2013940, October 1988","journal-title":"Journal of the Association for Computing Machinery"},{"key":"576_CR13","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"Gomory","year":"4","unstructured":"Gomory, R.E., Hu, T.C.: Multi-Terminal Network Flows. SIAM Journal on Applied Mathematics 9 (4), 551\u2013570, December 1961","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"576_CR14","unstructured":"Gourdin, E., Liau, B.: Personnal Communication 2003"},{"key":"576_CR15","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Design of Survivable Networks. chapter 10, pp. 617\u2013672. Handbooks in Operations Research and Management Science. Elsevier, North-Holland Amsterdam. 1995","DOI":"10.1016\/S0927-0507(05)80127-6"},{"key":"576_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1137\/0219009","volume":"19","author":"Gusfield","year":"1","unstructured":"Gusfield, D.: Very Simple Methods for All Pairs Network Flow Analysis. SIAM Journal on Computing 19 (1), 143\u2013155 February 1990","journal-title":"SIAM Journal on Computing"},{"key":"576_CR17","unstructured":"Hao, J., Orlin, J. B.: A faster algorithm for finding the minimum cut in a graph. Proc. of 3rd ACM-SIAM Symp. on Discrete Algorithms 1992, pp. 165\u2013174"},{"key":"576_CR18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/net.3230120306","volume":"12","author":"Itai","year":"1982","unstructured":"Itai, A., Perl, Y., Shiloach, Y.: The Complexity of Finding Maximum Disjoint Paths with Length Constraints. Networks 12, 277\u2013286 (1982)","journal-title":"Networks"},{"key":"576_CR19","doi-asserted-by":"crossref","unstructured":"Kerivin, H., Mahjoub, A.R.: Design of Survivable Networks: A Survey. To appear in Networks 2004","DOI":"10.1002\/net.20072"},{"key":"576_CR20","doi-asserted-by":"crossref","unstructured":"Lad\u00e1nyi, L., Ralphs, T.K., Trotter, L.E.: Computational Combinatorial Optimization: Optimal or Provably Near-Opimal Solutions. Branch Cut and Price: Sequential and Parallel 223\u2013260. Lecture Notes in Computer Science. Springer-Verlag, September 2001","DOI":"10.1007\/3-540-45586-8_6"},{"key":"576_CR21","doi-asserted-by":"crossref","unstructured":"Mahjoub, A.R.: Two-edge connected spanning subgraphs and polyhedra. Mathematical Programming 64, 199\u2013208 1994","DOI":"10.1007\/BF01582572"},{"key":"576_CR22","unstructured":"McCormick, S.T.: Personnal Communication 2001"},{"key":"576_CR23","unstructured":"Tsong-Ho Wu.: Fiber Network Service Survivability. Artech House Inc. 1992"},{"key":"576_CR24","unstructured":"Williamson, D.P.: Lecture Notes on Approximation Algorithms. IBM Research Division 1999"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0576-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0576-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0576-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T09:13:40Z","timestamp":1586164420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0576-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,14]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["576"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0576-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,14]]}}}