{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T02:29:34Z","timestamp":1783996174101,"version":"3.55.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s12532-010-0015-3","type":"journal-article","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T06:30:18Z","timestamp":1278052218000},"page":"125-165","source":"Crossref","is-referenced-by-count":30,"title":["The Mcf-separator: detecting and exploiting multi-commodity flow structures in MIPs"],"prefix":"10.1007","volume":"2","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Raack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,3]]},"reference":[{"key":"15_CR1","unstructured":"Achterberg, T.: Constraint Integer Programming. PhD thesis, Technische Universit\u00e4t Berlin. http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2007\/1611\/ (2007)"},{"key":"15_CR2","unstructured":"Achterberg, T., Raack, C.: The Mcf-separator\u2014Detecting and Exploiting Multi-Commodity Flow Structures in MIPs. ZIB-Report 07-38, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin. http:\/\/www.zib.de\/ (2009)"},{"key":"15_CR3","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB Oper. Res. Lett. 34(4):361\u2013372, (2003). http:\/\/miplib.zib.de\/ (2006)"},{"key":"15_CR4","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja R., Magnanti T., Orlin J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(01)00100-6","volume":"29","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk A.: Flow pack facets of the single node fixed-charge flow polytope. Oper. Res. Lett. 29, 107\u2013114 (2001)","journal-title":"Oper. Res. Lett."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk A.: On capacitated network design cut-set polyhedra. Math. Program. 92, 425\u2013437 (2002)","journal-title":"Math. Program."},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk A.: On the facets of the mixed-integer knapsack polyhedron. Math. Program. 98, 145\u2013175 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"15_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10479-005-3442-1","volume":"139","author":"A. Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk A.: Cover and pack inequalities for mixed integer programming. Ann. Oper. Res. 139(1), 21\u201338 (2005)","journal-title":"Ann. Oper. Res."},{"key":"15_CR9","unstructured":"Atamt\u00fcrk, A.: MIP instances. University of California, Berkeley. http:\/\/www.ieor.berkeley.edu\/~atamturk\/data\/ (2009)"},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s101070100284","volume":"92","author":"A. Atamt\u00fcrk","year":"2002","unstructured":"Atamt\u00fcrk A., Rajan D.: On splittable and unsplittable capacitated network design arc-set polyhedra. Math. Program. 92, 315\u2013333 (2002)","journal-title":"Math. Program."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s101070100235","volume":"91","author":"A. Atamt\u00fcrk","year":"2001","unstructured":"Atamt\u00fcrk A., Nemhauser G.L., Savelsbergh M.W.P.: Valid inequalities for problems with additive variable upper bounds. Math. Program. 91, 145\u2013162 (2001)","journal-title":"Math. Program."},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas E.: Facets of the knapsack polytope. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock D., G\u00fcnl\u00fck O.: Capacitated network design\u2014polyhedral structure and computation. INFORMS J. Comput. 8, 243\u2013259 (1996)","journal-title":"INFORMS J. Comput."},{"key":"15_CR14","first-page":"177","volume":"81","author":"D. Bienstock","year":"1998","unstructured":"Bienstock D., Chopra S., G\u00fcnl\u00fck O., Tsai C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81, 177\u2013199 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"15_CR15","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/mnsc.34.3.342","volume":"34","author":"R. Bixby","year":"1988","unstructured":"Bixby R., Fourer R.: Finding embedded network rows in linear programs I. Extraction heuristics. Manage. Sci. 34(3), 342\u2013376 (1988)","journal-title":"Manage. Sci."},{"issue":"1","key":"15_CR16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10479-006-0091-y","volume":"149","author":"R. Bixby","year":"2007","unstructured":"Bixby R., Rothberg E.: Progress in computational mixed integer programming\u2014a look back from the other side of the tipping point. Ann. Oper. Res. 149(1), 37\u201341 (2007)","journal-title":"Ann. Oper. Res."},{"key":"15_CR17","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58:12\u201315. http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html (1998)"},{"key":"15_CR18","first-page":"7","volume":"16","author":"B. Brockm\u00fcller","year":"2004","unstructured":"Brockm\u00fcller B., G\u00fcnl\u00fck O., Wolsey L.A.: Designing private line networks: polyhedral analysis and computation. Trans. Oper. Res. 16, 7\u201324 (2004)","journal-title":"Trans. Oper. Res."},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02591728","volume":"29","author":"G. Brown","year":"1984","unstructured":"Brown G., Wright W.: Automatic identification of embedded network rows in large-scale optimization models. Math. Program. 29, 41\u201356 (1984)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"15_CR20","first-page":"415","volume":"79","author":"M.R. Bussieck","year":"1997","unstructured":"Bussieck M.R., Kreuzer P., Zimmermann U.T.: Discrete optimization in public rail transport. Math. Program. 79(1\u20133), 415\u2013444 (1997)","journal-title":"Math. Program."},{"key":"15_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(98)00024-9","volume":"86","author":"S. Chopra","year":"1998","unstructured":"Chopra S., Gilboa I., Sastry S.T.: Source sink flows with capacity installation in batches. Discret. Appl. Math. 86, 165\u2013192 (1998)","journal-title":"Discret. Appl. Math."},{"key":"15_CR22","unstructured":"COmputational INfrastructure for Operations Research (COIN-OR) Cut Generation Library (CGL). https:\/\/projects.coin-or.org\/Cgl (2009)"},{"key":"15_CR23","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"G. Dahl","year":"1994","unstructured":"Dahl G., Stoer M.: A polyhedral approach to multicommodity survivable network design. Numer. Math. 68, 149\u2013167 (1994)","journal-title":"Numer. Math."},{"key":"15_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.10.1.1","volume":"10","author":"G. Dahl","year":"1998","unstructured":"Dahl G., Stoer M.: A cutting plane algorithm for multicommodity survivable network design problems. INFORMS J. Comput. 10, 1\u201311 (1998)","journal-title":"INFORMS J. Comput."},{"key":"15_CR25","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)"},{"key":"15_CR26","unstructured":"Gon\u00e7alves, J.P.M., Ladanyi, L.: An implementation of a separation procedure for mixed integer rounding inequalities. IBM Res. Report RC23686 (W0508-022), IBM (2005)"},{"key":"15_CR27","unstructured":"Gottlieb, J., Mittelmann, H.: FCTP instances. Arizona State University. http:\/\/plato.la.asu.edu\/ftp\/fctp\/ (2009)"},{"key":"15_CR28","first-page":"436","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85, 436\u2013467 (1999)","journal-title":"Math. Program."},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Gu, Z., Nemhauser, G.L., Savelsbergh, M.W.P.: Sequence independent lifting in mixed integer programming. INFORMS J. Comput. pp. 109\u2013129 (2000)","DOI":"10.1023\/A:1009841107478"},{"key":"15_CR30","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s101070050077","volume":"86","author":"O. G\u00fcnl\u00fck","year":"1999","unstructured":"G\u00fcnl\u00fck O.: A branch and cut algorithm for capacitated network design problems. Math. Program. 86, 17\u201339 (1999)","journal-title":"Math. Program."},{"issue":"2","key":"15_CR31","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s101070200292","volume":"92","author":"S.P.M. Hoesel","year":"2002","unstructured":"Hoesel S.P.M., Koster A.M.C.A., van de Leensel R.L.M.J., Savelsbergh M.W.P.: Polyhedral results for the edge capacity polytope. Math. Program. 92(2), 335\u2013358 (2002)","journal-title":"Math. Program."},{"key":"15_CR32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0166-218X(03)00436-0","volume":"133","author":"S.P.M. Hoesel","year":"2004","unstructured":"Hoesel S.P.M., Koster A.M.C.A., van de Leensel R.L.M.J., Savelsbergh M.W.P.: Bidirected and unidirected capacity installation in telecommunication networks. Discret. Appl. Math. 133, 103\u2013121 (2004)","journal-title":"Discret. Appl. Math."},{"key":"15_CR33","unstructured":"IBM-ILOG: Cplex. http:\/\/www.ilog.com\/products\/cplex\/ (2009)"},{"issue":"3","key":"15_CR34","first-page":"173","volume":"1","author":"Q. Louveaux","year":"2003","unstructured":"Louveaux Q., Wolsey L.A.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. 4OR 1(3), 173\u2013207 (2003)","journal-title":"4OR"},{"key":"15_CR35","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"33","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti T.L., Mirchandani P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 33, 103\u2013121 (1993)","journal-title":"Networks"},{"issue":"1","key":"15_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Magnanti T.L., Wong R.T.: Network design and transportation planning: models and algorithms. Trans. Sci. 18(1), 1\u201355 (1984)","journal-title":"Trans. Sci."},{"key":"15_CR37","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti T.L., Mirchandani P., Vachani R.: The convex hull of two core capacitated network design problems. Math. Program. 60, 233\u2013250 (1993)","journal-title":"Math. Program."},{"key":"15_CR38","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti T.L., Mirchandani P., Vachani R.: Modelling and solving the two-facility capacitated network loading problem. Oper. Res. 43, 142\u2013157 (1995)","journal-title":"Oper. Res."},{"key":"15_CR39","unstructured":"Marchand, H.: A polyhedral study of the mixed knapsack set and its use to solve mixed integer programs. PhD thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (1997)"},{"key":"15_CR40","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand H., Wolsey L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"issue":"3","key":"15_CR41","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand H., Wolsey L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49(3), 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"15_CR42","unstructured":"Mittelmann, H.: Benchmarks for optimization software. http:\/\/plato.asu.edu\/bench.html (2009)"},{"key":"15_CR43","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, London (1988)"},{"issue":"3","key":"15_CR44","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"Orlowski","year":"2010","unstructured":"Orlowski , S. , Pi\u00f3ro M., Tomaszewski A., Wess\u00e4ly R.: SNDlib 1.0\u2013Survivable Network Design Library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"key":"15_CR45","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/net.10068","volume":"41","author":"F. Ortega","year":"2003","unstructured":"Ortega F., Wolsey L.A.: A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41, 143\u2013158 (2003)","journal-title":"Networks"},{"key":"15_CR46","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M.W. Padberg","year":"1985","unstructured":"Padberg M.W., Roy T.J.V., Wolsey L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 33, 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"15_CR47","volume-title":"Routing, Flow, and Capacity Design in Communication and Computer Networks","author":"M. Pi\u00f3ro","year":"2004","unstructured":"Pi\u00f3ro M., Medhi D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers, Menlo Park (2004)"},{"key":"15_CR48","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y. Pochet","year":"1995","unstructured":"Pochet Y., Wolsey L.A.: Integer knapsack and flow covers with divisible coefficients. Discret. Appl. Math. 59, 57\u201374 (1995)","journal-title":"Discret. Appl. Math."},{"key":"15_CR49","unstructured":"Raack, C., Koster, A.M.C.A., Orlowski, S., Wess\u00e4ly, R.: Capacitated network design using general flow-cutset inequalities. In: Proceedings of the Third International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)"},{"key":"15_CR50","doi-asserted-by":"crossref","unstructured":"Raack, C., Koster, A.M.C.A., Orlowski, S., Wess\u00e4ly, R.: On cut-based inequalities for capacitated network design polyhedra. Networks (2010, to appear)","DOI":"10.1002\/net.20395"},{"key":"15_CR51","volume-title":"Handbook of Optimization in Telecommunications","year":"2006","unstructured":"Resende, M., Pardalos, P. (eds): Handbook of Optimization in Telecommunications. Springer, Berlin (2006)"},{"key":"15_CR52","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.J. Van Roy","year":"1986","unstructured":"Van Roy T.J., Wolsey L.A.: Valid inequalities for mixed 0-1 programs. Discret. Appl. Math. 14, 199\u2013213 (1986)","journal-title":"Discret. Appl. Math."},{"key":"15_CR53","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"Weismantel R.: On the 0\/1 knapsack polytope. Math. Program. 77, 49\u201368 (1997)","journal-title":"Math. Program."},{"key":"15_CR54","unstructured":"Wess\u00e4ly, R.: Dimensioning Survivable Capacitated NETworks. PhD thesis, Technische Universit\u00e4 Berlin (2000)"},{"key":"15_CR55","unstructured":"Wolsey, L.: UFCN instances. CORE, Universit\u00e9 catholique de Louvain. http:\/\/www.core.ucl.ac.be\/wolsey\/ufcn.htm (2009)"},{"key":"15_CR56","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"15_CR57","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey L.A.: Valid inequalities and superadditivity for 0\u20131 integer programs. Math. Oper. Res. 2, 66\u201377 (1977)","journal-title":"Math. Oper. Res."},{"key":"15_CR58","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley, London (1998)"},{"key":"15_CR59","unstructured":"Wolter, K.: Implementation of Cutting Plane Separators for Mixed Integer Programs. Master\u2019s thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"15_CR60","unstructured":"Zuse Institut Berlin: —Solving Constraint Integer Programs. http:\/\/scip.zib.de\/ (2009)"},{"key":"15_CR61","unstructured":"Zuse Institut Berlin: SNDlib\u2014Survivable Network Design Library. http:\/\/sndlib.zib.de\/ (2009)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0015-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-010-0015-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-010-0015-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T14:02:49Z","timestamp":1740232969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-010-0015-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":61,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["15"],"URL":"https:\/\/doi.org\/10.1007\/s12532-010-0015-3","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}