{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:16:12Z","timestamp":1765232172850,"version":"3.40.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_4","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"34-45","source":"Crossref","is-referenced-by-count":2,"title":["A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Bergner","sequence":"first","affiliation":[]},{"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]},{"given":"Jonas T.","family":"Witt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Programming Comp.\u00a01(1), 1\u201341 (2009)","journal-title":"Math. Programming Comp."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D. (eds.): Graph Partitioning and Graph Clustering. 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012. Contemp. Mathematics, vol.\u00a0588. American Mathematical Society (2013)","DOI":"10.1090\/conm\/588"},{"key":"4_CR3","unstructured":"Bornd\u00f6rfer, R., Kormos, Z.: An algorithm for maximum cliques. unpublished working paper, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin (1997)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0196-6774(03)00052-X","volume":"48","author":"A. Caprara","year":"2003","unstructured":"Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms\u00a048, 239\u2013256 (2003)","journal-title":"J. Algorithms"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.20008","volume":"44","author":"A. Caprara","year":"2004","unstructured":"Caprara, A., Panconesi, A., Rizzi, R.: Packing cuts in undirected graphs. Networks\u00a044(1), 1\u201311 (2004)","journal-title":"Networks"},{"key":"4_CR6","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn, C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)"},{"issue":"1-3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(88)90193-8","volume":"72","author":"C. Colbourn","year":"1988","unstructured":"Colbourn, C.: Edge-packing of graphs and network reliability. Discrete Math\u00a072(1-3), 49\u201361 (1988)","journal-title":"Discrete Math"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res.\u00a040(2), 342\u2013354 (1992)","journal-title":"Oper. Res."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., L\u00fcbbecke, M.: Branch-price-and-cut algorithms. In: Cochran, J. (ed.) Encyclopedia of Operations Research and Management Science. John Wiley & Sons, Chichester (2011)","DOI":"10.1002\/9780470400531.eorms0118"},{"issue":"12","key":"4_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R. Downey","year":"1995","unstructured":"Downey, R., Fellows, M.: Fixed-parameter tractability and completeness II: On completeness for W(1). Theoretical Computer Science\u00a0141(12), 109\u2013131 (1995), http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397594000973","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","unstructured":"Fox-Epstein, E.: Forbidden Pairs Make Problems Hard. Bachelor\u2019s thesis. Wesleyan University (2011)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D. Fulkerson","year":"1971","unstructured":"Fulkerson, D.: Blocking and anti-blocking pairs of polyhedra. Math. Programming\u00a01, 168\u2013194 (1971)","journal-title":"Math. Programming"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction, exact, and heuristic algorithms for clique cover. In: Proc. 8th ALENEX, pp. 86\u201394 (2006)","DOI":"10.1137\/1.9781611972863.9"},{"key":"4_CR14","unstructured":"Gutfraind, A., Meyers, L.A., Safro, I.: Multiscale network generation, arXiv:1207.4266 (2012)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Proc. of the 7th Python in Science Conference (SciPy 2008), Pasadena, pp. 11\u201315 (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. Algorithmica\u00a018(1), 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"4_CR17","unstructured":"Klimmek, R., Wagner, F.: A simple hypergraph min cut algorithm. Tech. Rep. B 96-02. FU Berlin (1996)"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L.T. Kou","year":"1978","unstructured":"Kou, L.T., Stockmeyer, L.J., Wong, C.K.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Commun. ACM\u00a021(2), 135\u2013139 (1978)","journal-title":"Commun. ACM"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C. Lucchesi","year":"1978","unstructured":"Lucchesi, C., Younger, D.: A minimax theorem for directed graphs. J. Lond. Math. Soc.\u00a017, 369\u2013374 (1978)","journal-title":"J. Lond. Math. Soc."},{"key":"4_CR20","unstructured":"Pettie, S., Ramachandran, V.: Randgraph graph generator (2006), http:\/\/www.dis.uniroma1.it\/challenge9\/download.shtml"},{"key":"4_CR21","unstructured":"Rinaldi, G.: Rudy, a graph generator (1998), http:\/\/www-user.tu-chemnitz.de\/~helmberg\/sdp_software.html"},{"key":"4_CR22","unstructured":"Robacker, J.T.: Min-max theorems on shortest chains and disjunct cuts of a network. Tech. Rep. RM-1660-PR. Rand Corporation (1956)"},{"issue":"2","key":"4_CR23","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"D.M. Ryan","year":"1976","unstructured":"Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. Opt. Res. Q.\u00a027(2), 367\u2013384 (1976)","journal-title":"Opt. Res. Q."},{"issue":"3","key":"4_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M. Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM\u00a044(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"key":"4_CR26","unstructured":"Trick, M.: Coloring instances (1993), http:\/\/mat.gsia.cmu.edu\/COLOR\/instances.html"},{"key":"4_CR27","unstructured":"Xu, K.: Bhoslib: Benchmarks with hidden optimum solutions for graph problems (2010), http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:04:19Z","timestamp":1746263059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}