{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T12:52:03Z","timestamp":1770987123839,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10479-005-3968-2","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"67-124","source":"Crossref","is-referenced-by-count":151,"title":["Integer-Programming Software Systems"],"prefix":"10.1007","volume":"140","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]},{"given":"Martin W. P.","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"3968_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","volume":"25","author":"K. Aardal","year":"2000","unstructured":"Aardal, K., C.A.J. Hurkens, and A.K. Lenstra. (2000). \u201cSolving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables.\u201d Mathematics of Operations Research 25(3), 427\u2013442.","journal-title":"Mathematics of Operations Research"},{"key":"3968_CR2","doi-asserted-by":"crossref","unstructured":"Aardal, K. and A. Lenstra. (2002). \u201cHard Equality Constrained Integer Knapsacks.\u201d In W. Cook and A. Schultz (eds.), Proc. 9th International IPCO Conference Springer-Verlag, pp. 350\u2013366.","DOI":"10.1007\/3-540-47867-1_25"},{"key":"3968_CR3","first-page":"221","volume":"71","author":"E.D. Anderson","year":"1995","unstructured":"Anderson, E.D. and K.D. Anderson. (1995). \u201cPresolving in Linear Programming.\u201d Mathematical Programming 71, 221\u2013225.","journal-title":"Mathematical Programming"},{"key":"3968_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003a","unstructured":"Atamt\u00fcrk, A. (2003a). \u201cOn the Facets of Mixed-Integer Knapsack Polyhedron.\u201d Mathematical Programming 98, 145\u2013175.","journal-title":"Mathematical Programming"},{"key":"3968_CR5","unstructured":"Atamt\u00fcrk, A. (2003b). \u201cStrong Formulations of Robust Mixed 0-1 Programming.\u201d Research Report BCOL.03.04. Available at http:\/\/ieor.berkeley.edu\/~atamturk (To appear in Mathematical Programming)."},{"key":"3968_CR6","unstructured":"Atamt\u00fcrk, A. and M. Zhang. (2004). \u201cTwo-Stage Robust Network Flow and Design for Demand Uncertainty.\u201d Research Report BCOL.04.03. Available at http:\/\/ieor.berkeley.edu\/~atamturk."},{"key":"3968_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E. (1975). \u201cFacets of the Knapsack Polytope.\u201d Mathematical Programming 8, 146\u2013164.","journal-title":"Mathematical Programming"},{"key":"3968_CR8","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., S. Ceria, G. Cornu\u00e9jols, and N. Natraj. (1996). \u201cGomory Cuts Revisited.\u201d Operations Research Letters 19, 1\u20139.","journal-title":"Operations Research Letters"},{"key":"3968_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/0134010","volume":"34","author":"E. Balas","year":"1978","unstructured":"Balas, E. and E. Zemel. (1978). \u201cFacets of the Knapsack Polytope from Minimal Covers.\u201d SIAM Journal of Applied Mathematics 34, 119\u2013148.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"3968_CR10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","volume":"22","author":"I. Barany","year":"1984","unstructured":"Barany, I., T.J. Van Roy, and L.A. Wolsey. (1984). \u201cUncapacitated lot Sizing: The Convex Hull of Solutions.\u201d Mathematical Programming Study 22, 32\u201343.","journal-title":"Mathematical Programming Study"},{"key":"3968_CR11","doi-asserted-by":"crossref","unstructured":"Beale, E.M.L. (1979). \u201cBranch and Bound Methods for Mathematical Programming Systems.\u201d In P.L. Hammer, E.L. Johnson, and B.H. Korte (eds.), Discrete Optimization II, North Holland Publishing Co, pp. 201\u2013219.","DOI":"10.1016\/S0167-5060(08)70351-0"},{"key":"3968_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. B\u00e9nichou","year":"1971","unstructured":"B\u00e9nichou, M., J.M. Gauthier, P. Girodet, G. Hentges, G. Ribi\u00e8re, and O. Vincent. (1971). \u201cExperiments in Mixed-Integer Linear Programming.\u201d Mathematical Programming 1, 76\u201394.","journal-title":"Mathematical Programming"},{"key":"3968_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas, D. and M. Sim. (2003). \u201cRobust Discrete Optimization and Network Flows.\u201d Mathematical Programming 98, 49\u201371.","journal-title":"Mathematical Programming"},{"key":"3968_CR14","first-page":"121","volume":"74","author":"D. Bienstock","year":"1996","unstructured":"Bienstock, D. (1996). \u201cComputational Study of a Family of Mixed-Integer Quadratic Programming Problems.\u201d Mathematical Programming 74, 121\u2013140.","journal-title":"Mathematical Programming"},{"key":"3968_CR15","volume-title":"Introduction to Stochastic Programming","author":"J.R. Birge","year":"1997","unstructured":"Birge, J.R. and F. Louveaux. (1997). Introduction to Stochastic Programming. New York: Springer Verlag."},{"key":"3968_CR16","unstructured":"Bixby, R.E., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2002). Mixed\u2013integer programming: A progress report."},{"key":"3968_CR17","doi-asserted-by":"crossref","unstructured":"Codato, G. and M. Fischetti. (2004). \u201cCombinatorial Benders' Cuts.\u201d In D. Bienstock, and G.L. Nemhauser (eds.), Proc. 10th International IPCO Conference Springer-Verlag; pp. 178\u2013195.","DOI":"10.1007\/978-3-540-25960-2_14"},{"key":"3968_CR18","doi-asserted-by":"crossref","unstructured":"Cornuejols, G. and M. Dawande. (1998). \u201cA Class of Hard Small 0-1 Programs.\u201d In R.E. Bixby, E.A. Boyd, and R.Z. Rios-Mercado (eds.), Proc. 6th International IPCO Conference Springer-Verlag, pp. 284\u2013293.","DOI":"10.1007\/3-540-69346-7_22"},{"key":"3968_CR19","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., E.L. Johnson, and M.W. Padberg. (1983). \u201cSolving Large\u2013Scale Zero-One Linear Programming Problems.\u201d Operations Research 31, 803\u2013834.","journal-title":"Operations Research"},{"key":"3968_CR20","unstructured":"Danna, E., E. Rothberg, and C.L. Pape. (2003). \u201cExploring Relaxation Induced Neighborhoods to Improve MIP Solutions.\u201d Technical report, ILOG, Inc."},{"key":"3968_CR21","unstructured":"Dash Optimization, L. (2004a). Proctor and Gamble Case Study."},{"key":"3968_CR22","unstructured":"Dash Optimization, L. (2004b). XPRESS-BCL Reference Manual\u2014Release 2.6."},{"key":"3968_CR23","unstructured":"Dash Optimization, L. (2004c). XPRESS-Mosel Language Reference Manual\u2014Release 1.4."},{"key":"3968_CR24","unstructured":"Dash Optimization, L. (2004d). XPRESS-Optimizer Reference Manual\u2014Release 15."},{"key":"3968_CR25","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1017\/S0269888901000030","volume":"16","author":"I.R.D. Farias","year":"2001","unstructured":"Farias, I.R.D., E.L. Johnson, and G.L. Nemhauser. (2001). \u201cBranch-and-Cut for Combinatorial Optimisation Problems without Auxiliary Binary Variables.\u201d Knowledge Engineering Review 16, 25\u201339.","journal-title":"Knowledge Engineering Review"},{"key":"3968_CR26","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"I.R.D. Farias","year":"2003","unstructured":"Farias, I.R.D., E.L. Johnson, and G.L. Nemhauser. (2003). \u201cA Polyhedral Study of the Cardinality Constrained Knapsack Problem.\u201d Mathematical Programming 96, 439\u2013467.","journal-title":"Mathematical Programming"},{"key":"3968_CR27","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M. and A. Lodi. (2003). \u201cLocal Branching.\u201d Mathematical Programming 98, 23\u201347.","journal-title":"Mathematical Programming"},{"key":"3968_CR28","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., F. Glover, and A. Lodi. (2005). \u2018The Feasibility Pump.\u201d Mathematical Programming 104, 91\u2013104.","journal-title":"Mathematical Programming"},{"key":"3968_CR29","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.20.5.736","volume":"20","author":"J.J.H. Forrest","year":"1974","unstructured":"Forrest, J.J.H., J.P.H. Hirst, and J.A. Tomlin. (1974). \u201cPractical Solution of Large Scale Mixed Integer Programming Problems with UMPIRE.\u201d Management Science 20, 736\u2013773.","journal-title":"Management Science"},{"key":"3968_CR30","unstructured":"Gomory, R.E. (1960). \u201cAn Algorithm for the Mixed Integer Problem.\u201d Technical Report RM-2597, The Rand Corporation."},{"key":"3968_CR31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J. Gondzio","year":"1997","unstructured":"Gondzio, J. (1997). \u201cPresolve Analysis of Linear Programs Prior to Applying an Interior Point Method.\u201d INFORMS Journal on Computing 9, 73\u201391.","journal-title":"INFORMS Journal on Computing"},{"key":"3968_CR32","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1998). \u201cLifted Cover Inequalities for 0-1 Integer Programs: Computation.\u201d INFORMS Journal on Computing 10, 427\u2013437.","journal-title":"INFORMS Journal on Computing"},{"key":"3968_CR33","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu, Z., G.L. Nemhauser, and M.W.P. Savelsbergh. (1999). \u201cLifted Flow Cover Inequalities for Mixed 0-1 Integer Programs.\u201d Mathematical Programming 85, 439\u2013467.","journal-title":"Mathematical Programming"},{"key":"3968_CR34","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/opre.29.1.49","volume":"29","author":"M. Guignard","year":"1981","unstructured":"Guignard, M. and K. Spielberg. (1981). \u201cLogical Reduction Methods in Zero\u2013One Programming.\u201d Operations Research 29, 49\u201374.","journal-title":"Operations Research"},{"key":"3968_CR35","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer, P.L., E.L. Johnson, and U.N. Peled. (1975). \u201cFacets of Regular 0-1 Polytopes.\u201d Mathematical Programming 8, 179\u2013206.","journal-title":"Mathematical Programming"},{"key":"3968_CR36","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0098-1354(00)00470-1","volume":"24","author":"I. Harjunkoski","year":"2000","unstructured":"Harjunkoski, I., V. Jain, and I.E. Grossman. (2000). \u201cHybrid Mixed-Integer\/Constraint Logic Programming Strategies for Solving Scheduling and Combinatorial Optimization Problems.\u201d Computers and Chemical Engineering 24, 337\u2013343.","journal-title":"Computers and Chemical Engineering"},{"key":"3968_CR37","unstructured":"Hirst, J.P.H. (1969). \u201cFeatures Required in Branch and Bound Algorithms for (0-1) Mixed Integer Linear Programming.\u201d Privately circulated manuscript."},{"key":"3968_CR38","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1017\/S0269888900001077","volume":"15","author":"J.N. Hooker","year":"2000","unstructured":"Hooker, J.N., G. Ottosson, E.S. Thornsteinsson, and H.-J. Kim. (2000). \u201cA Scheme for Unifying Optimization and Constraint Satisfaction Methods.\u201d Knowledge Engineering Review 15, 11\u201330.","journal-title":"Knowledge Engineering Review"},{"key":"3968_CR39","unstructured":"ILOG, I. (2002). ILOG OPL User's Manual."},{"key":"3968_CR40","unstructured":"ILOG, I. (2003). ILOG CPLEX 9.0 Reference Manual."},{"key":"3968_CR41","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. and I.E. Grossmann. (2001). \u201cAlgorithms for Hybrid MILP\/CP Methods.\u201d INFORMS Journal on Computing 13, 258\u2013276.","journal-title":"INFORMS Journal on Computing"},{"key":"3968_CR42","doi-asserted-by":"crossref","unstructured":"Land, A. and S. Powell. (1979). \u201cComputer Codes for Problems of Integer Programming.\u201d In P.L. Hammer, E.L. Johnson, and B.H. Korte (eds.), Discrete Optimization II North Holland Publishing Co, pp. 221\u2013269.","DOI":"10.1016\/S0167-5060(08)70352-2"},{"key":"3968_CR43","unstructured":"LINDO Systems, I. (2002). LINDO API User's Manual."},{"key":"3968_CR44","doi-asserted-by":"crossref","unstructured":"Louveaux, Q. and L.A. Wolsey. (2002). \u201cCombining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs.\u201d 27, 470\u2013484.","DOI":"10.1287\/moor.27.3.470.315"},{"key":"3968_CR45","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. and L.A. Wolsey. (2001). \u201cAggregation and Mixed Integer Rounding to Solve MIPs.\u201d Operations Research 49, 363\u2013371.","journal-title":"Operations Research"},{"key":"3968_CR46","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F. Margot","year":"2003","unstructured":"Margot, F. (2003). \u201cExploiting Orbits in Symmetric Ilp.\u201d Mathematical Programming 98, 3\u201321.","journal-title":"Mathematical Programming"},{"key":"3968_CR47","unstructured":"Martin, A., T. Achterberg, and T. Koch. (2003). MIPLIB 2003. http:\/\/miplib.zib.de\/."},{"key":"3968_CR48","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01584658","volume":"4","author":"G. Mitra","year":"1973","unstructured":"Mitra, G. (1973). \u201cInvestigation of Some Branch and Bound Strategies for the Solution of Mixed Integer Linear Programs.\u201d Mathematical Programming 4, 155\u2013170.","journal-title":"Mathematical Programming"},{"key":"3968_CR49","unstructured":"Mittelman, H. (2002). \u201cBenchmarks for Optimization Software.\u201d http:\/\/plato.asu.edu\/bench.html."},{"key":"3968_CR50","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization. New York: John Wiley & Sons."},{"key":"3968_CR51","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1990). \u201cA Recursive Procedure for Generating all Cuts for 0-1 Mixed Integer Programs.\u201d Mathematical Programming 46, 379\u2013390.","journal-title":"Mathematical Programming"},{"issue":"5","key":"3968_CR52","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1287\/opre.50.5.810.370","volume":"50","author":"J.H. Owen","year":"2002","unstructured":"Owen, J.H. and S. Mehrotra. (2002). \u201cOn the Value of Binary Expansions for General Mixed-Integer Linear Programs.\u201d Operations Research 50(5), 810\u2013819.","journal-title":"Operations Research"},{"key":"3968_CR53","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W. (1973). \u201cOn the Facial Structure of Set Packing Polyhedra.\u201d Mathematical Programming 5, 199\u2013215.","journal-title":"Mathematical Programming"},{"key":"3968_CR54","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M.W. Padberg","year":"1979","unstructured":"Padberg, M.W. (1979). \u201cCovering, Packing and Knapsack Problems.\u201d Annals of Discrete Mathematics 4, 265\u2013287.","journal-title":"Annals of Discrete Mathematics"},{"key":"3968_CR55","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., T.J.V. Roy, and L.A. Wolsey. (1985). \u201cValid Linear Inequalities for Fixed Charge Problems.\u201d Operations Research 33, 842\u2013861.","journal-title":"Operations Research"},{"key":"3968_CR56","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. (1994). \u201cPreprocessing and Probing Techniques for Mixed Integer Programming Problems.\u201d ORSA Journal on Computing 6, 445\u2013454.","journal-title":"ORSA Journal on Computing"},{"key":"3968_CR57","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D. and J.C. Smith. (2001). \u201cImproving Discrete Model Representations via Symmetry Considerations.\u201d Management Science 47, 1396\u20131407.","journal-title":"Management Science"},{"key":"3968_CR58","unstructured":"van der Vlerk, M.H. (1996\u20132003). \u201cStochastic Integer Programming Bibliography.\u201d http:\/\/mally.eco.rug.nl\/biblio\/stoprog.html."},{"key":"3968_CR59","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T.J. Van Roy","year":"1987","unstructured":"Van Roy, T.J. and L.A. Wolsey. (1987). \u201cSolving Mixed Integer Programming Problems using Automatic Reformulation.\u201d Operations Research 35, 45\u201357.","journal-title":"Operations Research"},{"key":"3968_CR60","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A. (1998). Integer Programming. New York: John Wiley & Sons."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3968-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3968-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3968-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T06:12:24Z","timestamp":1586585544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3968-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3968"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3968-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}