{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:17:03Z","timestamp":1729642623719,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,10]]},"DOI":"10.1109\/drcn.2007.4762290","type":"proceedings-article","created":{"date-parts":[[2009,1,28]],"date-time":"2009-01-28T11:20:36Z","timestamp":1233141636000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["The k-edge connected subgraph problem: Valid inequalities and Branch-and-Cut"],"prefix":"10.1109","author":[{"given":"F.","family":"Bendali","sequence":"first","affiliation":[]},{"given":"I.","family":"Diarrassouba","sequence":"additional","affiliation":[]},{"given":"M. Didi","family":"Biha","sequence":"additional","affiliation":[]},{"given":"A. R.","family":"Mahjoub","sequence":"additional","affiliation":[]},{"given":"J.","family":"Mailfert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-68874-4_13"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582572"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"article-title":"heuristics for designing highly survivable communication networks","year":"1989","author":"ko","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585735"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1002\/net.20072"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"12","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1090\/dimacs\/005\/08","article-title":"polyhedral approches to network survivability","volume":"5","author":"grotschel","year":"1991","journal-title":"Series Discrete Mathematics and Computer Science"},{"year":"0","key":"21"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0403027"},{"article-title":"abacus - a branch-and-cut system","year":"1995","author":"thienel","key":"20"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2007.4762290"},{"year":"0","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00015-6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2003.11.007"},{"year":"0","author":"cplex","key":"5"},{"key":"4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/S0895480191222665","article-title":"the k-edge connected spanning subgraph polyhedron","volume":"7","author":"chopra","year":"1994","journal-title":"SIAM Journal on Discrete Matematics"},{"key":"9","article-title":"computer and intractability: a guide to the theory of np-completness","author":"garey","year":"1979","journal-title":"Freeman San Francisco"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0654-8"}],"event":{"name":"2007 6th International Workshop on Design and Reliable Communication Networks (DRCN)","start":{"date-parts":[[2007,10,7]]},"location":"La Rochelle, France","end":{"date-parts":[[2007,10,10]]}},"container-title":["2007 6th International Workshop on Design and Reliable Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4753884\/4762251\/04762290.pdf?arnumber=4762290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T11:49:39Z","timestamp":1558093779000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4762290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/drcn.2007.4762290","relation":{},"subject":[],"published":{"date-parts":[[2007,10]]}}}