{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:00:46Z","timestamp":1774126846623,"version":"3.50.1"},"reference-count":126,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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":[[2011,6]]},"DOI":"10.1007\/s12532-011-0025-9","type":"journal-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T05:24:35Z","timestamp":1307337875000},"page":"103-163","source":"Crossref","is-referenced-by-count":288,"title":["MIPLIB 2010"],"prefix":"10.1007","volume":"3","author":[{"given":"Thorsten","family":"Koch","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Achterberg","sequence":"additional","affiliation":[]},{"given":"Erling","family":"Andersen","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Bastert","sequence":"additional","affiliation":[]},{"given":"Timo","family":"Berthold","sequence":"additional","affiliation":[]},{"given":"Robert E.","family":"Bixby","sequence":"additional","affiliation":[]},{"given":"Emilie","family":"Danna","sequence":"additional","affiliation":[]},{"given":"Gerald","family":"Gamrath","sequence":"additional","affiliation":[]},{"given":"Ambros M.","family":"Gleixner","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Mittelmann","sequence":"additional","affiliation":[]},{"given":"Ted","family":"Ralphs","sequence":"additional","affiliation":[]},{"given":"Domenico","family":"Salvagnin","sequence":"additional","affiliation":[]},{"given":"Daniel E.","family":"Steffy","sequence":"additional","affiliation":[]},{"given":"Kati","family":"Wolter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,7]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K. Aardal","year":"2000","unstructured":"Aardal K., Bixby R.E., Hurkens C.A.J., Lenstra A.K., Smeltink J.W.: Market split and basis reduction: towards a solution of the Cornu\u00e9jols\u2013Dawande instances. INFORMS J. Comput. 12(3), 192\u2013202 (2000)","journal-title":"INFORMS J. Comput."},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, vol. 5547 of Lecture Notes in Computer Science","author":"T. Achterberg","year":"2009","unstructured":"Achterberg T., Berthold T.: Hybrid branching. In: van Hoeve, W.J., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, vol. 5547 of Lecture Notes in Computer Science, pp. 309\u2013311. Springer, Berlin (2009)"},{"issue":"4","key":"25_CR3","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T. Achterberg","year":"2006","unstructured":"Achterberg T., Koch T., Martin A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361\u2013372 (2006)","journal-title":"Oper. Res. Lett."},{"key":"25_CR4","unstructured":"Achterberg, T., Koch, T., Tuchscherer, A.: On the effect of minor changes in model formulations. Technical Report ZR 08-29. Zuse Institute Berlin (2008)"},{"issue":"2","key":"25_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s12532-010-0015-3","volume":"2","author":"T. Achterberg","year":"2010","unstructured":"Achterberg T., Raack C.: The MCF-separator\u2014detecting and exploiting multi-commodity flows in MIPs. Math. Program. Comput. 2(2), 125\u2013165 (2010)","journal-title":"Math. Program. Comput."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Ahmadizadeh, K., Dilkina, B., Gomes, C.P., Sabharwal, A.: An empirical study of optimization for maximizing diffusion in networks. In: Principles and Practice of Constraint Programming, vol. 6308 of Lecture Notes in Computer Science, pp. 514\u2013521 (2010)","DOI":"10.1007\/978-3-642-15396-9_41"},{"key":"25_CR7","unstructured":"Akartunal\u0131, K., Miller, A.J.: Computational analysis of lower bounds for big bucket production planning problems. Technical Report, http:\/\/www.optimization-online.org\/DB_HTML\/2007\/05\/1668.html , Optimization Online (2007)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/j.ejor.2007.11.033","volume":"193","author":"K. Akartunal\u0131","year":"2009","unstructured":"Akartunal\u0131 K., Miller A.J.: A heuristic approach for big bucket multi-level production planning problems. Eur. J. Oper. Res. 193, 396\u2013411 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Hayashida, M., Tamura, T.: Integer programming-based methods for attractor detection and control of Boolean networks. In: Proceedings of the Combined 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference, pp. 5610\u20135617 (2009)","DOI":"10.1109\/CDC.2009.5400017"},{"key":"25_CR10","unstructured":"Allen, S.D., Burke, E.K., Marecek, J.: A space-indexed formulation of packing boxes into a larger box. Technical Report. University of Nottingham (2010)"},{"issue":"3","key":"25_CR11","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/s10107-002-0363-5","volume":"95","author":"E. Amaldi","year":"2003","unstructured":"Amaldi E., Pfetsch M.E., Trotter L.E. Jr: On the maximum feasible subsystem problem, IISs, and IIS-hypergraphs. Math. Program. 95(3), 533\u2013554 (2003)","journal-title":"Math. Program."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.orl.2006.12.010","volume":"35","author":"D.L. Applegate","year":"2007","unstructured":"Applegate D.L., Cook W., Dash S., Espinoza D.G.: Exact solutions to linear programming problems. Oper. Res. Lett. 35, 693\u2013699 (2007)","journal-title":"Oper. Res. Lett."},{"key":"25_CR13","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":"25_CR14","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."},{"key":"25_CR15","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."},{"issue":"6","key":"25_CR16","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1287\/opre.1090.0694","volume":"57","author":"L. Bai","year":"2009","unstructured":"Bai L., Rubin P.A.: Combinatorial Benders cuts for the minimum tollbooth problem. Oper. Res. 57(6), 1510\u20131522 (2009)","journal-title":"Oper. Res."},{"key":"25_CR17","unstructured":"Bai, L., Stamps, M.T., Harwood, R.C., Kollmann, C.J.: A genetic algorithm for the minimum tollbooth problem. In: Proceedings of the 2006 Meeting of the Decision Sciences Institute (2006)"},{"issue":"6","key":"25_CR18","first-page":"20","volume":"23","author":"J. Barutt","year":"1990","unstructured":"Barutt J., Hull T.: Airline crew scheduling: supercomputers and algorithms. SIAM News 23(6), 20\u201322 (1990)","journal-title":"SIAM News"},{"key":"25_CR19","unstructured":"Belotti, P., Malucelli, F.: A Lagrangian relaxation approach for the design of networks with shared protection. In: Proceedings of the 2003 International Network Optimization Conference, pp. 72\u201377 (2003)"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. Benichou","year":"1971","unstructured":"Benichou M., Gauthier J., Girodet P., Hentges G., Ribiere G., Vincent O.: Experiments in mixed-integer programming. Math. Program. 1, 76\u201394 (1971)","journal-title":"Math. Program."},{"key":"25_CR21","unstructured":"Bentz, W., Martens, M., Orlowski, S., Werner, A., Wess\u00e4ly, R.: FTTx-PLAN: Optimierter Aufbau von FTTx-Netzen. In: Breitbandversorgung in Deutschland, vol. 220 of ITG-Fachbericht. VDE-Verlag, Berlin (2010)"},{"issue":"1","key":"25_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R.E. Bixby","year":"2002","unstructured":"Bixby R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50(1), 3\u201315 (2002)","journal-title":"Oper. Res."},{"key":"25_CR23","first-page":"16","volume":"25","author":"R.E. Bixby","year":"1992","unstructured":"Bixby R.E., Boyd E.A., Indovina R.R.: MIPLIB: a test set of mixed integer programming problems. SIAM News 25, 16 (1992)","journal-title":"SIAM News"},{"key":"25_CR24","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby R.E., Ceria S., McZeal C., Savelsbergh M.: An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315 (1998)","journal-title":"Optima"},{"key":"25_CR25","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1016\/j.cor.2009.12.008","volume":"37","author":"A. Bley","year":"2010","unstructured":"Bley A., Boland N., Fricke C., Froyland G.: A strengthened formulation and cutting planes for the open pit mine production scheduling problem. Comput. Oper. Res. 37, 1641\u20131647 (2010)","journal-title":"Comput. Oper. Res."},{"key":"25_CR26","unstructured":"Bley, A., Koch, T.: Integer programming approaches to access and backbone IP-network planning. Technical Report ZR 02-41. Zuse Institute Berlin (2002)"},{"key":"25_CR27","unstructured":"Bley, A., Menne, U., Klaehne, R., Raack, C., Wessaely, R.: Multi-layer network design\u2014a model-based optimization approach. In: Proceedings of the 5th Polish-German Teletraffic Symposium, pp. 107\u2013116 (2008)"},{"key":"25_CR28","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-642-11269-0_3","volume-title":"Parameterized and Exact Computation, vol. 5917 of Lecture Notes in Computer Science","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker S., H\u00fcffner F., Truss A., Wahlstr\u00f6m M.: A faster fixed-parameter approach to drawing binary tanglegrams. In: Chen, J., Fomin, F. (eds) Parameterized and Exact Computation, vol. 5917 of Lecture Notes in Computer Science, pp. 38\u201349. Springer, Berlin (2009)"},{"key":"25_CR29","unstructured":"Bornd\u00f6rfer, R.: Aspects of Set Packing, Partitioning, and Covering. Ph.D. Thesis, Technische Universit\u00e4t Berlin. Shaker Verlag, Aachen (1998)"},{"key":"25_CR30","first-page":"391","volume-title":"Proceedings of the 7th International Workshop on Computer-Aided Transit Scheduling, vol. 471 of Lecture Notes in Economics and Mathematical Systems","author":"R. Bornd\u00f6rfer","year":"1999","unstructured":"Bornd\u00f6rfer R., Gr\u00f6tschel M., Klostermeier F., K\u00fcttner C.: Telebus Berlin: vehicle scheduling in a dial-a-ride system. In: Wilson, N. (eds) Proceedings of the 7th International Workshop on Computer-Aided Transit Scheduling, vol. 471 of Lecture Notes in Economics and Mathematical Systems, pp. 391\u2013422. Springer, Berlin (1999)"},{"key":"25_CR31","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-3-540-77903-2_69","volume-title":"Operations Research Proceedings 2007","author":"R. Bornd\u00f6rfer","year":"2008","unstructured":"Bornd\u00f6rfer R., Liebchen C.: When periodic timetables are suboptimal. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007, pp. 449\u2013454. Springer, Berlin (2008)"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Bornd\u00f6rfer, R., L\u00f6bel, A., Weider, S.: A bundle method for integrated multi-depot vehicle and duty scheduling in public transit. In: Hickman, M., Mirchandani, P., Vo, S. (eds.) Computer-aided Systems in Public Transport, vol. 600 of Lecture Notes in Economics and Mathematical Systems, pp. 3\u201324 (2008)","DOI":"10.1007\/978-3-540-73312-6_1"},{"key":"25_CR33","unstructured":"Bornd\u00f6rfer, R., Schlechte, T.: Models for railway track allocation. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Dagstuhl Publishing, Germany (2007)"},{"issue":"2","key":"25_CR34","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s001860300332","volume":"59","author":"M.R. Bussieck","year":"2004","unstructured":"Bussieck M.R., Lindner T., L\u00fcbbecke M.E.: A fast algorithm for near optimal line plans. Math. Methods Oper. Res. 59(2), 205\u2013220 (2004)","journal-title":"Math. Methods Oper. Res."},{"key":"25_CR35","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara A., Fischetti M., Toth P.: A heuristic method for the set covering problem. Oper. Res. 47, 730\u2013743 (1999)","journal-title":"Oper. Res."},{"key":"25_CR36","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/B:ANOR.0000032577.81139.84","volume":"130","author":"A. Chabrier","year":"2004","unstructured":"Chabrier A., Danna E., Pape C.L., Perron L.: Solving a network design problem. Ann. Oper. Res. 130, 217\u2013239 (2004)","journal-title":"Ann. Oper. Res."},{"key":"25_CR37","doi-asserted-by":"crossref","DOI":"10.1201\/9781420010541","volume-title":"Handbook of Combinatorial Designs","author":"C. Colbourn","year":"2006","unstructured":"Colbourn C., Dinitz J.: Handbook of Combinatorial Designs, 2nd ed. Chapman & Hall\/CRC, Boca Raton (2006)","edition":"2"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Cook, W., Koch, T., Steffy, D., Wolter K.: An exact rational mixed-integer programming solver. Integer Program. Comb. Optim. (2011, in press)","DOI":"10.1007\/978-3-642-20807-2_9"},{"issue":"2","key":"25_CR39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/ijoc.11.2.205","volume":"11","author":"G. Cornu\u00e9jols","year":"1999","unstructured":"Cornu\u00e9jols G., Dawande M.: A class of hard small 0-1 programs. INFORMS J. Comput. 11(2), 205\u2013210 (1999)","journal-title":"INFORMS J. Comput."},{"key":"25_CR40","first-page":"226","volume-title":"Experimental Algorithms, vol. 6049 of Lecture Notes in Computer Science","author":"E. Coughlan","year":"2010","unstructured":"Coughlan E., L\u00fcbbecke M., Schulz J.: A branch-and-price algorithm for multi-mode resource leveling. In: Festa, P. (eds) Experimental Algorithms, vol. 6049 of Lecture Notes in Computer Science, pp. 226\u2013238. Springer, Berlin (2010)"},{"issue":"2","key":"25_CR41","doi-asserted-by":"crossref","first-page":"35","DOI":"10.5711\/morj.6.2.35","volume":"6","author":"N.D. Curet","year":"2001","unstructured":"Curet N.D.: The network diversion problem. Mil. Oper. Res. 6(2), 35\u201344 (2001)","journal-title":"Mil. Oper. Res."},{"key":"25_CR42","unstructured":"Danna, E.: Performance variability in mixed integer programming. Presentation at Workshop on Mixed Integer Programming (2008)"},{"key":"25_CR43","volume-title":"Convex Optimization & Euclidean Distance Geometry","author":"J. Dattorro","year":"2011","unstructured":"Dattorro J.: Convex Optimization & Euclidean Distance Geometry. Meboo Publishing, USA (2011)"},{"issue":"2","key":"25_CR44","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1287\/opre.1050.0263","volume":"54","author":"M. Dawande","year":"2006","unstructured":"Dawande M., Gavirneni S., Tayur S.: Effective heuristics for multiproduct partial shipment models. Oper. Res. 54(2), 337\u2013352 (2006)","journal-title":"Oper. Res."},{"key":"25_CR45","unstructured":"Dawande, M., Kalagnanam, J.: The multiple knapsack problem with color constraints. Research Report RC 21138. IBM (1998)"},{"key":"25_CR46","unstructured":"Dittel, A., F\u00fcgenschuh, A., Martin, A.: Polyhedral aspects of self-avoiding walks. Technical Report ZR 11-11. Zuse Institute Berlin (2011)"},{"key":"25_CR47","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"25_CR48","doi-asserted-by":"crossref","unstructured":"Eckstein, J.: Control strategies for parallel mixed integer branch and bound. In: Proceedings of Supercomputing 1994, pp. 41\u201348. IEEE Computer Society Press, Washington (1994)","DOI":"10.1145\/602783.602785"},{"issue":"1","key":"25_CR49","first-page":"12","volume":"27","author":"J. Eckstein","year":"1994","unstructured":"Eckstein J.: Parallel branch-and-bound methods for mixed integer programming. SIAM News 27(1), 12\u201315 (1994)","journal-title":"SIAM News"},{"issue":"4","key":"25_CR50","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"Eckstein J.: Parallel branch-and-bound methods for mixed integer programming on the CM-5. SIAM J. Optim. 4(4), 794\u2013814 (1994)","journal-title":"SIAM J. Optim."},{"key":"25_CR51","unstructured":"Eisenbl\u00e4tter, A., F\u00fcgenschuh, A., Fledderus, E., Geerdes, H.-F., Heideck, B., Junglas, D., Koch, T., K\u00fcrner, T., Martin, A.: Mathematical methods for automatic optimization of UMTS radio networks. Technical Report D4.3, IST-2000-28088 MOMENTUM (2003)"},{"key":"25_CR52","unstructured":"Espinoza, D.G.: On linear programming, integer programming and cutting planes. PhD Thesis. Georgia Institute of Technology (2006)"},{"key":"25_CR53","first-page":"2","volume":"66","author":"M.C. Ferris","year":"2001","unstructured":"Ferris M.C., Pataki G., Schmieta S.: Solving the seymour problem. Optima 66, 2\u20136 (2001)","journal-title":"Optima"},{"key":"25_CR54","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti M., Glover F., Lodi A.: The feasibility pump. Math. Program. 104, 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"25_CR55","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti M., Lodi A.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"25_CR56","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1287\/ijoc.1040.0078","volume":"18","author":"J.J.H. Forrest","year":"2006","unstructured":"Forrest J.J.H., Kalagnanam J., Ladanyi L.: A column-generation approach to the multiple knapsack problem with color constraints. INFORMS J. Comput. 18(1), 129\u2013134 (2006)","journal-title":"INFORMS J. Comput."},{"key":"25_CR57","volume-title":"AMPL: A Modelling Language for Mathematical Programming","author":"R. Fourer","year":"2002","unstructured":"Fourer R., Gay D.M., Kernighan B.W.: AMPL: A Modelling Language for Mathematical Programming, 2nd ed. Duxbury Press, Brooks\/Cole Publishing Company, Monterey (2002)","edition":"2"},{"key":"25_CR58","unstructured":"Gaden, D., K\u00fc\u00e7\u00fckyavuz, S.: Deterministic lot sizing with service levels. Technical Report. http:\/\/www.optimization-online.org\/DB_HTML\/2010\/12\/2844.html , Optimization Online (2010)"},{"key":"25_CR59","unstructured":"Galati, M.: Decomposition Methods for Integer Linear Programming. PhD Thesis. Lehigh University (2010)"},{"issue":"1","key":"25_CR60","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D. Goldberg","year":"1991","unstructured":"Goldberg D.: What every computer scientist should know about floating-point arithmetic. ACM Comput. Surv. 23(1), 5\u201348 (1991)","journal-title":"ACM Comput. Surv."},{"issue":"9\u201310","key":"25_CR61","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.mcm.2010.12.047","volume":"53","author":"B. Goldengorin","year":"2011","unstructured":"Goldengorin B., Krushinsky D.: Complexity evaluation of benchmark instances for the p-median problem. Math. Comput. Model. 53(9\u201310), 1719\u20131736 (2011)","journal-title":"Math. Comput. Model."},{"key":"25_CR62","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub G.H., Van Loan C.F.: Matrix Computations, 3rd ed. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"issue":"3","key":"25_CR63","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.1030.0051","volume":"38","author":"J.-W. Goossens","year":"2004","unstructured":"Goossens J.-W., van Hoesel S., Kroon L.G.: A branch-and-cut approach for solving railway line-planning problems. Transp. Sci. 38(3), 379\u2013393 (2004)","journal-title":"Transp. Sci."},{"key":"25_CR64","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-642-55753-8_50","volume-title":"MATHEMATICS\u2014Key Technology for the Future","author":"M. Gr\u00f6tschel","year":"2003","unstructured":"Gr\u00f6tschel M., Bornd\u00f6rfer R., L\u00f6bel A.: Duty scheduling in public transit. In: J\u00e4ger, W., Krebs, H.-J. (eds) MATHEMATICS\u2014Key Technology for the Future, pp. 653\u2013674. Springer, Berlin (2003)"},{"key":"25_CR65","first-page":"213","volume":"68","author":"O. G\u00fcnl\u00fck","year":"1995","unstructured":"G\u00fcnl\u00fck O., Bienstock D.: Computational experience with a difficult mixed-integer multicommodity flow problem. Math. Program. 68, 213\u2013237 (1995)","journal-title":"Math. Program."},{"issue":"4","key":"25_CR66","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1287\/opre.1060.0374","volume":"55","author":"C. Helmberg","year":"2007","unstructured":"Helmberg C., R\u00f6hl S.: A case study of joint online truck scheduling and inventory management for multiple warehouses. Oper. Res. 55(4), 733\u2013752 (2007)","journal-title":"Oper. Res."},{"key":"25_CR67","doi-asserted-by":"crossref","unstructured":"Holub, P., Rudov\u00e1, H., Li\u0161ka, M.: Data transfer planning with tree placement for collaborative environments. Constraints (2011, in press)","DOI":"10.1007\/s10601-011-9106-7"},{"key":"25_CR68","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10878-009-9212-2","volume":"20","author":"F. H\u00fcffner","year":"2010","unstructured":"H\u00fcffner F., Betzler N., Niedermeier R.: Separator-based data reduction for signed graph balancing. J. Comb. Optim. 20, 335\u2013360 (2010)","journal-title":"J. Comb. Optim."},{"key":"25_CR69","volume-title":"50 Years of Integer Programming 1958\u20132008","year":"2009","unstructured":"J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds): 50 Years of Integer Programming 1958\u20132008. Springer, Berlin (2009)"},{"key":"25_CR70","unstructured":"Koch, T.: Rapid Mathematical Programming. PhD Thesis. Technische Universit\u00e4t Berlin (2004)"},{"key":"25_CR71","unstructured":"Lau, A.: Erstellen von wegeoptimierten Stundenpl\u00e4nen mit Diskreten Methoden. Diploma Thesis. Technische Universit\u00e4t Chemnitz (2008)"},{"key":"25_CR72","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1287\/ijoc.1080.0293","volume":"21","author":"R. Laundy","year":"2009","unstructured":"Laundy R., Perregaard M., Tavares G., Tipi H., Vazacopoulos A.: Solving hard mixed integer programming problems with Xpress-MP: a MIPLIB 2003 case study. INFORMS J. Comput. 21, 304\u2013319 (2009)","journal-title":"INFORMS J. Comput."},{"key":"25_CR73","unstructured":"Liebchen, C., M\u00f6hring, R.H.: Information on the MIPLIB\u2019s timetab-instances. Technical Report 2003\/49. Technische Universit\u00e4t Berlin, Department of Mathematics (2003)"},{"key":"25_CR74","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.13.3.191.12630","volume":"13","author":"J.T. Linderoth","year":"2001","unstructured":"Linderoth J.T., Lee E.K., Savelsbergh M.W.P.: A parallel, linear programming based heuristic for large scale set partitioning problems. INFORMS J. Comput. 13, 191\u2013209 (2001)","journal-title":"INFORMS J. Comput."},{"key":"25_CR75","first-page":"3239","volume-title":"Wiley Encyclopedia of Operations Research and Management Science, vol. 5","author":"J.T. Linderoth","year":"2011","unstructured":"Linderoth J.T., Lodi A.: MILP software. In: Cochran, J. (eds) Wiley Encyclopedia of Operations Research and Management Science, vol. 5, pp. 3239\u20133248. Wiley, New York (2011)"},{"key":"25_CR76","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J.T. Linderoth","year":"1999","unstructured":"Linderoth J.T., Savelsbergh M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11, 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"25_CR77","first-page":"619","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A. Lodi","year":"2009","unstructured":"Lodi A.: MIP computation. In: J\u00fcnger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Reinelt, G., Rinaldi, G., Wolsey, L. (eds) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Berlin (2009)"},{"key":"25_CR78","unstructured":"Luzzi, I.: Exact and Heuristic Methods for Nesting Problems. PhD Thesis. University of Padova (2002)"},{"key":"25_CR79","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-002-0316-z","volume":"94","author":"F. Margot","year":"2003","unstructured":"Margot F.: Small covering designs by branch-and-cut. Math. Program. B 94, 207\u2013220 (2003)","journal-title":"Math. Program. B"},{"key":"25_CR80","unstructured":"Martin, A.: Integer Programs with Block Structure. Habilitations-Schrift, Technische Universit\u00e4t Berlin (1998)"},{"key":"25_CR81","unstructured":"Meirich, R.: Polyedrische Untersuchung eines Linienplanungsproblems. Diploma Thesis. Technische Universit\u00e4t Berlin (2010)"},{"issue":"11","key":"25_CR82","first-page":"3463","volume":"48","author":"R. Miyashiro","year":"2007","unstructured":"Miyashiro R., Yano Y., Muramatsu M.: On the maximum number of strings in go. Trans. Inf. Proces. Soc. Jpn. 48(11), 3463\u20133469 (2007)","journal-title":"Trans. Inf. Proces. Soc. Jpn."},{"issue":"1","key":"25_CR83","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/opre.46.1.1","volume":"46","author":"G.L. Nemhauser","year":"1998","unstructured":"Nemhauser G.L., Trick M.A.: Scheduling a major college basketball conference. Oper. Res. 46(1), 1\u20138 (1998)","journal-title":"Oper. Res."},{"issue":"3","key":"25_CR84","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","volume":"55","author":"S. Orlowski","year":"2010","unstructured":"Orlowski S., Pi\u00f3ro M., Tomaszewski A., Wess\u00e4ly R.: SNDlib 1.0\u2014Survivable Network Design Library. Networks 55(3), 276\u2013286 (2010)","journal-title":"Networks"},{"issue":"3","key":"25_CR85","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 branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41(3), 143\u2013158 (2003)","journal-title":"Networks"},{"key":"25_CR86","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.orl.2011.02.001","volume":"39","author":"J. Ostrowski","year":"2011","unstructured":"Ostrowski J., Linderoth J., Rossi F., Smriglio S.: Solving large Steiner triple covering problems. Oper. Res. Lett. 39, 127\u2013131 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"25_CR87","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/inte.29.2.73","volume":"29","author":"D.M. Panton","year":"1999","unstructured":"Panton D.M., Elbers A.W.: Mission planning for synthetic aperture radar surveillance. Interfaces 29(2), 73\u201388 (1999)","journal-title":"Interfaces"},{"key":"25_CR88","unstructured":"Peeters, L.: Cyclic Railway Timetable Optimization. PhD Thesis. Erasmus Universiteit Rotterdam (2003)"},{"key":"25_CR89","unstructured":"Pfender, T.: Arboreszenz-Fl\u00fcsse in Graphen: polyedrische Untersuchungen. Diploma Thesis. Technische Universit\u00e4t Berlin (2000)"},{"key":"25_CR90","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/050645828","volume":"19","author":"M.E. Pfetsch","year":"2008","unstructured":"Pfetsch M.E.: Branch-and-cut for the maximum feasible subsystem problem. SIAM J. Optim. 19, 21\u201338 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"25_CR91","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/ijoc.1030.0042","volume":"16","author":"Y. Pochet","year":"2004","unstructured":"Pochet Y., Vyve M.V.: A general heuristic for production planning problems. INFORMS J. Comput. 16(3), 316\u2013327 (2004)","journal-title":"INFORMS J. Comput."},{"key":"25_CR92","unstructured":"Polo, C.: Algoritmi euristici per il progetto ottimo di una rete di interconnessione. Technical Report. Testi di laurea in Ingegneria Informatica, Universitit\u00e0 degli Studi di Padova (2002)"},{"issue":"2","key":"25_CR93","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.20395","volume":"57","author":"C. Raack","year":"2011","unstructured":"Raack C., Koster A.M.C.A., Orlowski S., Wess\u00e4ly R.: On cut-based inequalities for capacitated network design polyhedra. Networks 57(2), 141\u2013156 (2011)","journal-title":"Networks"},{"key":"25_CR94","unstructured":"Reuter, A.: Kombinatorische Auktionen und ihre Anwendungen im Schienenverkehr. Diploma Thesis. Technische Universit\u00e4t Berlin (2005)"},{"key":"25_CR95","unstructured":"Schilly, H.: Modellierung und Implementation eines Vorlesungsplaners. Diploma Thesis. Universit\u00e4t Wien (2007)"},{"key":"25_CR96","unstructured":"Sheldon, D., Dilkina, B., Elmachtoub, A., Finseth, R., Sabharwal, A., Conrad, J., Gomes, C.P., Shmoys, D., Allen, W., Amundsen, O., Vaughan, B.: Maximizing spread of cascades using network design. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence, pp. 517\u2013526 (2010)"},{"key":"25_CR97","unstructured":"Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP\u2014a parallel extension of SCIP. Technical Report ZR 10-27. Zuse Institute Berlin (2010)"},{"issue":"3","key":"25_CR98","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.51.3.487.14949","volume":"51","author":"H. Stadtler","year":"2003","unstructured":"Stadtler H.: Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51(3), 487\u2013502 (2003)","journal-title":"Oper. Res."},{"key":"25_CR99","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0377-2217(97)00284-1","volume":"106","author":"M. Sun","year":"1998","unstructured":"Sun M., Aronson J.E., McKeown P.G., Drinka D.A.: A tabu search heuristic procedure for the fixed charge transportation problem. Eur. J. Oper. Res. 106, 441\u2013456 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR100","unstructured":"Torres Carvajal, L.M.: Online Vehicle Routing. PhD Thesis. Technische Universit\u00e4t Berlin (2003)"},{"key":"25_CR101","unstructured":"Troubil, P., Rudov\u00e1, H.: Integer programming for media streams planning problem. In: Matyska, L., Kozubek, M., Vojnar, T., Zemc\u00edk, P., Antos, D. (eds.) In: Proceedings of the Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, vol. 16 of Open Access Series in Informatics, pp. 116\u2013123. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Germany (2011)"},{"key":"25_CR102","unstructured":"Walser, J.P.: Radar surveillance. http:\/\/www.ps.uni-saarland.de\/~walser\/radar\/radar.html (1997)"},{"key":"25_CR103","unstructured":"Walser, J.P.: Solving linear pseudo-boolean constraint problems with local search. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Conference on Innovative Applications of Artificial Intelligence, pp. 269\u2013274. AAAI Press, California (1997)"},{"key":"25_CR104","unstructured":"Walser, J.P.: Solving the ACC basketball scheduling problem with integer local search. http:\/\/www.ps.uni-saarland.de\/~walser\/acc\/acc.html (1998)"},{"key":"25_CR105","unstructured":"Weider, S.: Integration of Vehicle and Duty Scheduling in Public Transport. PhD Thesis. Technische Universit\u00e4t Berlin (2007)"},{"key":"25_CR106","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley-Interscience, New York (1998)"},{"key":"25_CR107","unstructured":"Yunes, T.: CuSPLIB 1.0: A library of single-machine cumulative scheduling problems. http:\/\/moya.bus.miami.edu\/~tallys\/cusplib\/ (2009)"},{"key":"25_CR108","unstructured":"Berkeley Computational Optimization Lab-Data Sets. http:\/\/ieor.berkeley.edu\/~atamturk\/data\/"},{"key":"25_CR109","unstructured":"COR@L MIP Instances. http:\/\/coral.ie.lehigh.edu\/data-sets\/mixed-integer-instances\/"},{"key":"25_CR110","unstructured":"Convex Optimization of Eternity II. http:\/\/www.convexoptimization.com\/wikimization\/index.php\/Dattorro_Convex_Optimization_of_Eternity_II"},{"key":"25_CR111","unstructured":"DEIS-Operations Research Group Library of Instances. http:\/\/www.or.deis.unibo.it\/research_pages\/ORinstances\/MIPs.html"},{"key":"25_CR112","unstructured":"Eternity II puzzle. http:\/\/www.eternityii.com"},{"key":"25_CR113","unstructured":"GNU linear programming toolkit version 4.45. http:\/\/www.gnu.org\/software\/glpk"},{"key":"25_CR114","unstructured":"GMP, GNU multiple precision arithmetic library. http:\/\/gmplib.org"},{"key":"25_CR115","unstructured":"Management of Inter-Warehouse-Logistics for Stochastic Demand. http:\/\/www.tu-chemnitz.de\/mathematik\/discrete\/projects\/warehouse_trucks\/index.html"},{"key":"25_CR116","unstructured":"ICC, Intel C++ compiler. http:\/\/software.intel.com\/en-us\/articles\/intel-compilers\/"},{"key":"25_CR117","unstructured":"IEEE standard 754-2008 for floating-point arithmetic (2008)"},{"key":"25_CR118","unstructured":"Challenge Problems: Independent Sets in Graphs. http:\/\/www2.research.att.com\/~njas\/doc\/graphs.html"},{"key":"25_CR119","unstructured":"lp_solve 5.5.2. http:\/\/lpsolve.sourceforge.net"},{"key":"25_CR120","unstructured":"MULTILSB: Multi-Item Lot-Sizing with Backlogging. http:\/\/personal.strath.ac.uk\/kerem.akartunali\/research\/multi-lsb\/"},{"key":"25_CR121","unstructured":"NEOS Server for Optimization. http:\/\/www.neos-server.org"},{"key":"25_CR122","unstructured":"Pseudo-Boolean Competition 2010. http:\/\/www.cril.univ-artois.fr\/PB10\/"},{"key":"25_CR123","unstructured":"QSopt_ex. http:\/\/www.dii.uchile.cl\/~daespino\/ESolver_doc\/main.html"},{"key":"25_CR124","unstructured":"IBM Ponder This-August 2008. http:\/\/domino.research.ibm.com\/comm\/wwwr_ponder.nsf\/challenges\/August2008.html"},{"key":"25_CR125","unstructured":"SNDlib. http:\/\/sndlib.zib.de"},{"key":"25_CR126","unstructured":"TSPLIB. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0025-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-011-0025-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-011-0025-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T09:58:09Z","timestamp":1712483889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-011-0025-9"}},"subtitle":["Mixed Integer Programming Library version 5"],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":126,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s12532-011-0025-9","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}