{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T18:25:46Z","timestamp":1786645546127,"version":"3.56.0"},"reference-count":102,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T00:00:00Z","timestamp":1232409600000},"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":[[2009,7]]},"DOI":"10.1007\/s12532-008-0001-1","type":"journal-article","created":{"date-parts":[[2009,1,19]],"date-time":"2009-01-19T14:16:22Z","timestamp":1232374582000},"page":"1-41","source":"Crossref","is-referenced-by-count":859,"title":["SCIP: solving constraint integer programs"],"prefix":"10.1007","volume":"1","author":[{"given":"Tobias","family":"Achterberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,1,20]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg T.: Conflict analysis in mixed integer programming. Discret. Optim. 4(1), 4\u201320 (2007) (special issue: Mixed Integer Programming)","journal-title":"Discret. Optim."},{"key":"1_CR2","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. Thesis, Technische Universit\u00e4t Berlin (2007). http:\/\/opus.kobv.de\/tuberlin\/volltexte\/2007\/1611\/"},{"issue":"1","key":"1_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg T., Berthold T.: Improving the feasibility pump. Discret. Optim. 4(1), 77\u201386 (2007) (special issue: Mixed Integer Programming)","journal-title":"Discret. Optim."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Achterberg, T., Berthold, T., Koch, T., Wolter, K.: Constraint integer programming: a new approach to integrate CP and MIP. In: Perron, L., Trick, M.A. (eds.) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, 5th international conference, CPAIOR 2008. Lecture Notes in Computer Science, vol. 5015, pp. 6\u201320. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68155-7_4"},{"key":"1_CR5","unstructured":"Achterberg, T., Brinkmann, R., Wedler, M.: Property checking with constraint integer programming. Technical Report 07-37, Zuse Institute Berlin (2007). http:\/\/opus.kobv.de\/zib\/volltexte\/2007\/1065\/"},{"issue":"6","key":"1_CR6","first-page":"14","volume":"33","author":"T. Achterberg","year":"2006","unstructured":"Achterberg T., Gr\u00f6tschel M., Koch T.: Teaching MIP modeling and solving. ORMS Today 33(6), 14\u201315 (2006)","journal-title":"ORMS Today"},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T. Achterberg","year":"2005","unstructured":"Achterberg T., Koch T., Martin A.: Branching rules revisited. Oper. Res. Lett. 33, 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1_CR8","doi-asserted-by":"crossref","first-page":"1","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), 1\u201312 (2006)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"1_CR9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"S.B. Akers","year":"1978","unstructured":"Akers S.B.: Binary decision diagrams. IEEE Trans. Comput. C-27(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Althaus, E., Bockmayr, A., Elf, M., J\u00fcnger, M., Kasper, T., Mehlhorn, K.: SCIL\u2014symbolic constraints in integer linear programming. Technical Report ALCOMFT-TR-02-133, MPI Saarbr\u00fccken, May (2002)","DOI":"10.1007\/3-540-45749-6_11"},{"key":"1_CR11","unstructured":"Anders, C.: Das Chordalisierungspolytop und die Berechnung der Baumweite eines Graphen. Master\u2019s Thesis, Technische Universit\u00e4t Berlin (2006)"},{"issue":"2","key":"1_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1287\/ijoc.1050.0162","volume":"19","author":"G. Andreello","year":"2007","unstructured":"Andreello G., Caprara A., Fischetti M.: Embedding cuts in a branch&cut framework: a computational study with $${\\{0,\\frac{1}{2}\\}}$$ -cuts. INFORMS J. Comput. 19(2), 229\u2013238 (2007)","journal-title":"INFORMS J. Comput."},{"key":"1_CR13","volume-title":"The Traveling Salesman Problem","author":"D.L. Applegate","year":"2006","unstructured":"Applegate D.L., Bixby R.E., Chv\u00e1tal V., Cook W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2006)"},{"key":"1_CR14","unstructured":"Armbruster, M.: Branch-and-Cut for a Semidefinite Relaxation of the Minimum Bisection Problem. Ph.D. Thesis, Technische Universit\u00e4t Chemnitz (2007)"},{"key":"1_CR15","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Martin, A.: Experiments with linear and semidefinite relaxations for solving the minimum graph bisection problem. Technical Report, Darmstadt University of Technology (2006)"},{"key":"1_CR16","unstructured":"Armbruster, M., F\u00fcgenschuh, M., Helmberg, C., Martin, A.: On the bisection cut polytope. Darmstadt University of Technology (preprint, 2006)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Aron, I.D., Hooker, J.N., Yunes, T.H.: SIMPL: a system for integrating optimization techniques. In: R\u00e9gin, J.-C., Rueher, M. (eds.) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, first international conference, CPAIOR. Lecture Notes in Computer Science, vol. 3011, pp. 21\u201336. Springer, Nice, France (2004)","DOI":"10.1007\/978-3-540-24664-0_2"},{"key":"1_CR18","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":"1_CR19","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\u2014integer knapsack polyhedron. Math. Programm. 98, 145\u2013175 (2003)","journal-title":"Math. Programm."},{"key":"1_CR20","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. Programm. 92, 315\u2013333 (2002)","journal-title":"Math. Programm."},{"key":"1_CR21","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. Programm. 8, 146\u2013164 (1975)","journal-title":"Math. Programm."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G., Natraj N.: Gomory cuts revisited. Oper. Res. h Lett. 19, 1\u20139 (1996)","journal-title":"Oper. Res. h Lett."},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas E., Zemel E.: Facets of the knapsack polytope from minimal covers. SIAM J. Appl. Math. 34, 119\u2013148 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"1_CR24","first-page":"201","volume-title":"Discrete Optimization II","author":"E.M.L. Beale","year":"1979","unstructured":"Beale E.M.L.: Branch and bound methods for mathematical programming systems. In: Hammer, P.L., Johnson, E.L., Korte, B.H.(eds) Discrete Optimization II, pp. 201\u2013219. North Holland Publishing Co., Amsterdam (1979)"},{"key":"1_CR25","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou M., Gauthier J.M., Girodet P., Hentges G., Ribi\u00e8re G., Vincent O.: Experiments in mixed-integer linear programming. Math. Programm. 1, 76\u201394 (1971)","journal-title":"Math. Programm."},{"key":"1_CR26","unstructured":"Berthold, T.: Primal heuristics for mixed integer programs. Master\u2019s Thesis, Technische Universit\u00e4t Berlin"},{"key":"1_CR27","unstructured":"Berthold, T., Heinz, S., Pfetsch, M.E.: Solving pseudo-Boolean problems with SCIP. Report 07\u201310, Zuse Institute Berlin (2008)"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Biere, A., Clarke, E.M., Raimi, R., Zhu, Y.: Verifying safety properties of a Power PC microprocessor using symbolic model checking without BDDs. In: Computer-aided verification. Lecture Notes in Computer Science, vol. 1633, pp. 60\u201371. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48683-6_8"},{"key":"1_CR29","unstructured":"Bilgen, E.: Personalkostenminimierung bei der Einsatzplanung von parallelen identischen Bearbeitungszentren in der Motorradproduktion. Master\u2019s Thesis, Technische Universit\u00e4t Chemnitz (2007)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Bjesse, P., Leonard, T., Mokkedem, A.: Finding bugs in an Alpha microprocessor using satisfiability solvers. In: Computer-aided verification. Lecture Notes in Computer Science, vol. 2102, pp. 454\u2013464. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44585-4_44"},{"key":"1_CR31","unstructured":"Bley, A., Kupzog, F., Zymolka, A.: Auslegung heterogener Kommunikationsnetze nach performance und Wirtschaftlichkeit. In: Proceedings of 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, pp. 84\u201397, Kassel, November (2006)"},{"issue":"3","key":"1_CR32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.10.3.287","volume":"10","author":"A. Bockmayr","year":"1998","unstructured":"Bockmayr A., Kasper T.: Branch-and-infer: a unifying framework for integer and finite domain constraint programming. INFORMS J. Comput. 10(3), 287\u2013300 (1998)","journal-title":"INFORMS J. Comput."},{"key":"1_CR33","unstructured":"Bockmayr, A., Pisaruk, N.: Solving assembly line balancing problems by combining IP and CP. In: Sixth Annual Workshop of the ERCIM Working Group on Constraints, June (2001)"},{"key":"1_CR34","unstructured":"Brinkmann, R.: Preprocessing for Property Checking of Sequential Circuit on the Register Transfer Level. Ph.D. Thesis, University of Kaiserslautern, Kaiserslautern, Germany (2003)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Brinkmann, R., Drechsler, R.: RTL-datapath verification using integer linear programming. In: Proceedings of the IEEE VLSI Design Conference, pp. 741\u2013746 (2002)","DOI":"10.1109\/ASPDAC.2002.995022"},{"issue":"8","key":"1_CR36","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR37","unstructured":"Ceselli, A., Gatto, M., L\u00fcbbecke, M., Nunkesser, M., Schilling, H.: Optmizing the cargo express service of swiss federal railways. Transport. Sci. (to appear)"},{"key":"1_CR38","unstructured":"COIN-OR. Computational Infrastructure for Operations Research. http:\/\/www.coin-or.org"},{"key":"1_CR39","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder H., Johnson E.L., Padberg M.W.: Solving large scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"issue":"1","key":"1_CR40","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna E., Rothberg E., Le Pape C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Programm. 102(1), 71\u201390 (2005)","journal-title":"Math. Programm."},{"key":"1_CR41","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T. (ed.) Activity Analysis of Production and Allocation, pp. 339\u2013347. Wiley, New York (1951)"},{"key":"1_CR42","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"1_CR43","unstructured":"Dash Optimization. Xpress-MP. http:\/\/www.dashoptimization.com"},{"key":"1_CR44","unstructured":"Dix, A.: Das Statische Linienplanungsproblem. Master\u2019s Thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"1_CR45","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. Dolan","year":"2002","unstructured":"Dolan E., Mor\u00e9 J.: Benchmarking optimization software with performance profiles. Math. Programm. 91, 201\u2013213 (2002)","journal-title":"Math. Programm."},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) Proceedings of SAT 2003, pp. 502\u2013518. Springer, Heidelberg (2003)","DOI":"10.1007\/978-3-540-24605-3_37"},{"issue":"8","key":"1_CR47","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1109\/43.936380","volume":"CAD-20","author":"F. Fallah","year":"2001","unstructured":"Fallah F., Devadas S., Keutzer K.: Functional vector generation for HDL models using linear programming and boolean satisfiability. IEEE Trans. CAD CAD-20(8), 994\u20131002 (2001)","journal-title":"IEEE Trans. CAD"},{"issue":"1\u20133","key":"1_CR48","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. Programm. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Programm."},{"key":"1_CR49","unstructured":"Forrest, J.J.H.: COIN branch and cut. COIN-OR, http:\/\/www.coin-or.org"},{"key":"1_CR50","unstructured":"Forrest, J.J.H., de la Nuez, D., Lougee-Heimer, R.: CLP user guide. COIN-OR, http:\/\/www.coin-or.org\/Clp\/userguide"},{"key":"1_CR51","first-page":"69","volume-title":"Discrete Optimization. Handbooks in Operations Research and Management Science, Chap. 2, vol. 12","author":"A. F\u00fcgenschuh","year":"2005","unstructured":"F\u00fcgenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Operations Research and Management Science, Chap. 2, vol. 12, pp. 69\u2013122. Elsevier, Amsterdam (2005)"},{"key":"1_CR52","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): fast decision procedures. In: Proceedings of the International Conference on Computer Aided Verification (CAV-04). pp. 26\u201337 (2004)","DOI":"10.1007\/978-3-540-27813-9_14"},{"issue":"1","key":"1_CR53","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BF01593767","volume":"12","author":"J.M. Gauthier","year":"1977","unstructured":"Gauthier J.M., Ribi\u00e8re G.: Experiments in mixed-integer linear programming using pseudocosts. Math. Programm. 12(1), 26\u201347 (1977)","journal-title":"Math. Programm."},{"key":"1_CR54","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover F., Laguna M.: Tabu Search. Kluwer, Boston (1997)"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Gomory, R.E.: Solving linear programming problems in integers. In: Bellman, R., Hall, J.M. (eds.) Combinatorial Analysis Symposia in Applied Mathematics X, pp. 211\u2013215. American Mathematical Society, Providence (1960)","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"1_CR56","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programming. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"key":"1_CR57","unstructured":"Gottlieb, J., Paulmann, L.: Genetic algorithms for the fixed charge transportation problem. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 330\u2013335. IEEE Press, New York (1998)"},{"issue":"3","key":"1_CR58","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J.N. Hooker","year":"2007","unstructured":"Hooker J.N.: Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55(3), 588\u2013602 (2007)","journal-title":"Oper. Res."},{"key":"1_CR59","unstructured":"ILOG. Cplex. http:\/\/www.ilog.com\/products\/cplex"},{"issue":"4","key":"1_CR60","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1287\/ijoc.13.4.258.9733","volume":"13","author":"V. Jain","year":"2001","unstructured":"Jain V., Grossmann I.E.: Algorithms for hybrid MILP\/CP models for a class of optimization problems. INFORMS J. Comput. 13(4), 258\u2013276 (2001)","journal-title":"INFORMS J. Comput."},{"key":"1_CR61","unstructured":"Jerraya, A.A., Wolf, W.: Multiprocessor Systems-on-Chips. The Morgan Kaufmann Series in Systems on Silicon. Elsevier\/Morgan Kaufman, Boston\/San Francisco (2004)"},{"key":"1_CR62","first-page":"169","volume":"16","author":"E.L. Johnson","year":"1982","unstructured":"Johnson E.L., Padberg M.W.: Degree-two inequalities, clique facets, and biperfect graphs. Ann. Discret. Math. 16, 169\u2013187 (1982)","journal-title":"Ann. Discret. Math."},{"issue":"1","key":"1_CR63","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/S0895480104445885","volume":"20","author":"M. Joswig","year":"2006","unstructured":"Joswig M., Pfetsch M.E.: Computing optimal Morse matchings. SIAM J. Discret. Math. 20(1), 11\u201325 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"1_CR64","doi-asserted-by":"crossref","unstructured":"Kaibel, V., Peinhardt, M., Pfetsch, M.E.: Orbitopal fixing. In: Fischetti, M., Williamson, D. (eds.) Proceedings of the 12th Integer Programming and Combinatorial Optimization conference (IPCO). LNCS, vol. 4513, pp. 74\u201388. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72792-7_7"},{"key":"1_CR65","doi-asserted-by":"crossref","unstructured":"Koch, T.: Rapid mathematical programming or how to solve sudoku puzzles in a few seconds. In: Haasis, H.-D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operations Research Proceedings 2005, pp. 21\u201326 (2006)","DOI":"10.1007\/3-540-32539-5_4"},{"key":"1_CR66","unstructured":"Kutschka, M.: Algorithmen zur Separierung von $${\\{0,\\frac{1}{2}\\}}$$ -Schnitten. Master\u2019s Thesis, Technische Universit\u00e4t Berlin (2007)"},{"key":"1_CR67","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-5060(08)70352-2","volume":"5","author":"A. Land","year":"1979","unstructured":"Land A., Powell S.: Computer codes for problems of integer programming. Ann. Discret. Math. 5, 221\u2013269 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"2","key":"1_CR68","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A.N. Letchford","year":"2002","unstructured":"Letchford A.N., Lodi A.: Strengthening Chv\u00e1tal\u2013Gomory cuts and Gomory fractional cuts. Oper. Res. Lett. 30(2), 74\u201382 (2002)","journal-title":"Oper. Res. Lett."},{"key":"1_CR69","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of 15th International Joint Conference on Artificial Interlligence (IJCAI 1997), pp. 366\u2013371. Morgan Kaufmann, Japan (1997)"},{"key":"1_CR70","doi-asserted-by":"crossref","unstructured":"Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Proceedings of third international conference on Principles and Practice of Constraint Programming (CP 1997), pp. 342\u2013356. Springer, Autriche (1997)","DOI":"10.1007\/BFb0017450"},{"key":"1_CR71","doi-asserted-by":"crossref","unstructured":"Linderoth, J.T., Ralphs, T.K.: Noncommercial software for mixed-integer linear programming. In: Karlof, J. (ed.) Integer Programming: Theory and Practice, Operations Research Series, pp. 253\u2013303. CRC Press, Boca Raton (2005)","DOI":"10.1201\/9781420039597.ch10"},{"key":"1_CR72","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":"1_CR73","doi-asserted-by":"crossref","unstructured":"Madre, J.C., Billon, J.P.: Proving circuit correctness using formal comparison between expected and extracted behavior. In: Proceedings of the 25th Design Automation Conference, pp. 205\u2013210 (1988)","DOI":"10.1109\/DAC.1988.14759"},{"key":"1_CR74","unstructured":"Manquinho, V., Roussel, O.: Pseudo Boolean evaluation (2007). http:\/\/www.cril.univ-artois.fr\/PB07\/"},{"key":"1_CR75","unstructured":"Marchand, H.: A polyhedral study of the mixed knapsack set and its use to solve mixed integer programs. Ph.D. Thesis, Facult\u00e9 des Sciences Appliqu\u00e9es, Universit\u00e9 catholique de Louvain (1998)"},{"issue":"3","key":"1_CR76","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":"1_CR77","doi-asserted-by":"crossref","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz H.M., Manne A.S.: On the solution of discrete programming problems. Econometrica 25, 84\u2013110 (1957)","journal-title":"Econometrica"},{"key":"1_CR78","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva J.P., Sakallah K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48, 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"1_CR79","unstructured":"Martin, A.: Integer programs with block structure. Habilitations-Schrift, Technische Universit\u00e4t Berlin (1998). http:\/\/www.zib.de\/Publications\/abstracts\/SC-99-03\/"},{"key":"1_CR80","unstructured":"Martin, A., Weismantel, R.: The intersection of knapsack polyhedra and extensions. In: Bixby, R.E., Boyd, E., R\u00edos-Mercado, R.Z. (eds.) Integer programming and combinatorial optimization. Proceedings of the 6th IPCO Conference, pp. 243\u2013256 (1998). http:\/\/www.zib.de\/Publications\/abstracts\/SC-97-61\/"},{"key":"1_CR81","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01584658","volume":"4","author":"G. Mitra","year":"1973","unstructured":"Mitra G.: Investigations of some branch and bound strategies for the solution of mixed integer linear programs. Math. Programm. 4, 155\u2013170 (1973)","journal-title":"Math. Programm."},{"key":"1_CR82","unstructured":"Mittelmann, H.: Decision tree for optimization software: Benchmarks for optimization software. http:\/\/plato.asu.edu\/bench.html"},{"key":"1_CR83","unstructured":"Mosek. Mosek Optimization tools. http:\/\/www.mosek.com"},{"key":"1_CR84","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the Design Automation Conference, July (2001)","DOI":"10.1145\/378239.379017"},{"issue":"1","key":"1_CR85","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."},{"key":"1_CR86","unstructured":"Nunkesser, M.: Algorithm design and analysis of problems in manufacturing, logistic, and telecommunications: An algorithmic jam session. Ph.D. Thesis, Eidgen\u00f6ssische Technische Hochschule ETH Z\u00fcrich (2006)"},{"key":"1_CR87","unstructured":"Orlowski, S., Koster, A.M.C.A., Raack, C., Wess\u00e4ly, R.: Two-layer network design by branch- and-cut featuring MIP-based heuristics. In: Proceedings of the Third International Network Optimization Conference (INOC 2007). Spa, Belgium (2007)"},{"issue":"4","key":"1_CR88","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., Wolsey L.A.: Valid inequalities for fixed charge problems. Oper. Res. 33(4), 842\u2013861 (1985)","journal-title":"Oper. Res."},{"key":"1_CR89","doi-asserted-by":"crossref","unstructured":"Parthasarathy, G., Iyer, M.K., Cheng, K.T., Wang, L.C.: An efficient finite-domain constraint solver for RTL circuits. In: Proceedings of the International Design Automation Conference (DAC-04) June (2004)","DOI":"10.1145\/996566.996628"},{"key":"1_CR90","unstructured":"Pfetsch, M.E.: Branch-and-cut for the maximum feasible subsystem problem. Report 05-46, ZIB (2005)"},{"key":"1_CR91","unstructured":"Ryan, D.M., Foster, B.A.: An integer programming approach to scheduling. In: Wren, A. (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North Holland, Amsterdam (1981)"},{"key":"1_CR92","unstructured":"Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master\u2019s Thesis, Simon Fraser University"},{"key":"1_CR93","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1287\/ijoc.6.4.445","volume":"6","author":"M.W.P. Savelsbergh","year":"1994","unstructured":"Savelsbergh M.W.P.: Preprocessing and probing techniques for mixed integer programming problems. ORSA J. Comput. 6, 445\u2013454 (1994)","journal-title":"ORSA J. Comput."},{"key":"1_CR94","unstructured":"Thienel, S.: ABACUS\u2014A Branch-and-Cut System. Ph.D. Thesis, Institut f\u00fcr Informatik, Universit\u00e4t zu K\u00f6ln (1995)"},{"issue":"4","key":"1_CR95","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00291-002-0107-1","volume":"24","author":"C. Timpe","year":"2002","unstructured":"Timpe C.: Solving planning and scheduling problems with combined integer and constraint programming. OR Spectr. 24(4), 431\u2013448 (2002)","journal-title":"OR Spectr."},{"key":"1_CR96","unstructured":"VALSE-XT: Eine integrierte L\u00f6sung f\u00fcr die SoC-Verifikation (2005). http:\/\/www.edacentrum.de\/ekompass\/projektflyer\/pf-valse-xt.pdf"},{"issue":"2","key":"1_CR97","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0166-218X(86)90061-2","volume":"14","author":"T.J. Roy van","year":"1986","unstructured":"Roy T.J., Wolsey L.A.: Valid inequalities for mixed 0-1 programs. Discret. Appl. Math. 14(2), 199\u2013213 (1986)","journal-title":"Discret. Appl. Math."},{"key":"1_CR98","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"29","author":"L.A. Wolsey","year":"1990","unstructured":"Wolsey L.A.: Valid inequalities for 0-1 knapsacks and MIPs with generalized upper bound constraints. Discret. Appl. Math. 29, 251\u2013261 (1990)","journal-title":"Discret. Appl. Math."},{"key":"1_CR99","unstructured":"Wolter, K.: Implementation of cutting plane separators for mixed integer programs. Master\u2019s Thesis, Technische Universit\u00e4t Berlin (2006)"},{"key":"1_CR100","unstructured":"Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. Ph.D. Thesis, Technische Universit\u00e4t Berlin (1996). http:\/\/www.zib.de\/Publications\/abstracts\/TR-96-09\/"},{"key":"1_CR101","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Kalla, P., Ciesielski, M.: LPSAT: a unified approach to RTL satisfiability. In: Proceedings of Conference on Design, Automation and Test in Europe (DATE-01) Munich, March (2001)","DOI":"10.1109\/DATE.2001.915055"},{"key":"1_CR102","unstructured":"Zuse Institute Berlin. SCIP: solving constraint integer programs. http:\/\/scip.zib.de"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-008-0001-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-008-0001-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-008-0001-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T02:05:02Z","timestamp":1738893902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-008-0001-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,20]]},"references-count":102,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["1"],"URL":"https:\/\/doi.org\/10.1007\/s12532-008-0001-1","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,20]]}}}