{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:09:43Z","timestamp":1648980583729},"reference-count":59,"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-3974-4","type":"journal-article","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T12:12:53Z","timestamp":1133007173000},"page":"263-304","source":"Crossref","is-referenced-by-count":2,"title":["Logical Processing for Integer Programming"],"prefix":"10.1007","volume":"140","author":[{"given":"Monique","family":"Guignard","sequence":"first","affiliation":[]},{"given":"Ellis L.","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Kurt","family":"Spielberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3974_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/inte.21.1.62","volume":"21","author":"R. Anbil","year":"1991","unstructured":"Anbil, R., E. Gelman, B. Patty, and R. Tanga. (1991). \u201cRecent Advances in Crew-Pairing Optimization at American Airlines.\u201d Interfaces 21(1), 62\u201374.","journal-title":"Interfaces"},{"key":"3974_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1147\/sj.311.0071","volume":"31","author":"R. Anbil","year":"1992","unstructured":"Anbil, R., R. Tanga, and E.L. Johnson. (1992). \u201cA Global Approach to Crew Pairing Optimization.\u201d IBM Systems Journal 31, 71\u201378.","journal-title":"IBM Systems Journal"},{"key":"3974_CR3","unstructured":"Atamturk, A. and M. Savelsbergh. (2003). \u201cComputational Evidence of Progress in Integer Programming.\u201d Annals of Operations Research 2005 (this volume)."},{"key":"3974_CR4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"Balas, E. (1965). \u201cAn Additive Algorithm for Solving Linear Programs with Zero-One Variables.\u201d Op. Res. 13, 517\u2013546.","journal-title":"Op. Res."},{"key":"3974_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800080104","volume":"8","author":"M. Balinski","year":"1961","unstructured":"Balinski, M. (1961). \u201cFixed cost transportation problems.\u201d Naval Research Logistics Quarterly 8, 41\u201354.","journal-title":"Naval Research Logistics Quarterly"},{"key":"3974_CR6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"14","author":"M. Balinski","year":"1965","unstructured":"Balinski, M. (1965). \u201cInteger Programming: Methods, Uses, Computation.\u201d Management Science 14, 253\u2013313.","journal-title":"Management Science"},{"key":"3974_CR7","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F. (1962). \u201cPartitioning Procedures for Solving Mixed Variable Programming Problems.\u201d Numerische Mathematik 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"3974_CR8","doi-asserted-by":"crossref","unstructured":"Bixby, R., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). \u201cMIP: Theory and Practice\u2014Closing the Gap.\u201d In M.J.D. Powell and S. Scholtes (eds.), System Modeling and Optimization: Methods, Theory and Applications, Kluwer.","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"3974_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0167-5060(08)70732-5","volume":"1","author":"G. Cornuejols","year":"1977","unstructured":"Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). \u201cOn the Uncapacitated Location Problem.\u201d Annals of Discrete Mathematics 1, 163\u2013177.","journal-title":"Annals of Discrete Mathematics"},{"key":"3974_CR10","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., E. Johnson, and M. Padberg. (1983). \u201cSolving Large Scale Zero-One Linear Programming Problems.\u201d Op. Res. 31, 903\u2013834.","journal-title":"Op. Res"},{"issue":"4","key":"3974_CR11","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/net.3230140406","volume":"14","author":"J. Desrosiers","year":"1984","unstructured":"Desrosiers, J., F. Soumis, and M. Desrochers. (1984). \u201cRouting with Time-Windows.\u201d Network 14(4), 545\u2013565.","journal-title":"Network"},{"key":"3974_CR12","doi-asserted-by":"crossref","unstructured":"Dietrich, B. and L. Escudero. (1992). \u201cOn Tightening Cover Induced Inequalities.\u201d Eur. J. of OR 60.","DOI":"10.1016\/0377-2217(92)90085-N"},{"key":"3974_CR13","unstructured":"Escudero, L., S. Martello, and P. Toth. (1994). \u201cA Framework for Tightening 0-1 Programs based on Extensions of Pure 0-1 KP and SS Problems.\u201d IPCO-4."},{"key":"3974_CR14","doi-asserted-by":"crossref","unstructured":"Fischetti, M. and A. Lodi. (2003). \u201cLocal Branching.\u201d Mathematical Programming, Series B 98, 23\u201347.","DOI":"10.1007\/s10107-003-0395-5"},{"key":"3974_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"M.L. Fisher","year":"1978","unstructured":"Fisher, M.L., G.L. Nemhauser, and L.A. Wolsey. (1978). \u201cAnalysis of Approximation Algorithms for Maximizing a Submodular Set Function II.\u201d Math. Programming Study 8, 73\u201387.","journal-title":"Math. Programming Study"},{"key":"3974_CR16","unstructured":"Forrest, J. (1999). \u201cMixed Integer Programming in OSL,\u201d INFORMS Meeting, Philadelphia."},{"key":"3974_CR17","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F. Glover","year":"1965","unstructured":"Glover, F. (1965). \u201cA Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem.\u201d Op. Res. 13, 879\u2013919.","journal-title":"Op. Res"},{"key":"3974_CR18","doi-asserted-by":"crossref","unstructured":"Glover, F. (1971). \u201cFlows in Arborescences.\u201d Management Sc., 17.","DOI":"10.1287\/mnsc.17.9.568"},{"key":"3974_CR19","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1287\/opre.19.4.1023","volume":"19","author":"F. Glover","year":"1971","unstructured":"Glover, F. (1971). \u201cA Note on Extreme Point Solutions and a Paper by Lemke, Salkin, Spielberg.\u201d Op. Res. 19, 1023\u20131025.","journal-title":"Op. Res"},{"key":"3974_CR20","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory, R.E. (1958). \u201cOutline of an Algorithm for Integer Solutions to Linear Programs.\u201d Bulletin of the Am. Math. Soc. 64, 275\u2013278.","journal-title":"Bulletin of the Am. Math. Soc"},{"key":"3974_CR21","unstructured":"Granot, F. and P. Hammer. (1972). \u201cOn the Use of Boolean Functions in (0-1) Programming.\u201d Methods of OR, 12, Verlag Hain, 184."},{"key":"3974_CR22","first-page":"277","volume":"16","author":"F. Granot","year":"1974","unstructured":"Granot, F. and P. Hammer. (1974). \u201cOn the Role of Generalized Covering Problems.\u201d Cahiers du Centre d'Etude de Recherche Operationelle 16, 277\u2013289.","journal-title":"Cahiers du Centre d'Etude de Recherche Operationelle"},{"key":"3974_CR23","unstructured":"Guignard, M. and K. Spielberg. (1969). \u201cSearch Techniques with Adaptive Features for certain Mixed Integer Programming Problems.\u201d Proceedings of 1968 IFIPS Congress, North Holland."},{"key":"3974_CR24","unstructured":"Guignard, M. (1973a). \u201cPreferred Shadow Prices in 0-1 Programming,\u201d Wharton School Report; also presented at the International Symposium on Mathematical Programming, Stanford University, 1973."},{"key":"3974_CR25","unstructured":"Guignard, M. (1973b). \u201cPreferred Variables and Improved Penalties in 0-1 Programming.\u201d Wharton School Report, 1973, revised 1975 and 1976."},{"key":"3974_CR26","unstructured":"Guignard, M., E.L. Johnson, and K. Spielberg. (2005). \u201cLogical Processing for MIP,\u201d Georgia Institute of Technology Report, pp. 1\u201338, to be published later."},{"issue":"1","key":"3974_CR27","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0377-2217(92)90297-M","volume":"56","author":"M. Guignard","year":"1992","unstructured":"Guignard, M. and M. Liberatore. (1992). \u201cApplying a Modified Coefficient Reduction Method to a Dynamic Production Scheduling Problem.\u201d European Journal of Operational Research 56(1), 119\u2013130.","journal-title":"European Journal of Operational Research"},{"key":"3974_CR28","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0377-2217(97)00362-7","volume":"111","author":"M. Guignard","year":"1998","unstructured":"Guignard, M., C. Ryu, and K. Spielberg. (1998). \u201cModel Tightening for Integrated Timber Harvest and Transportation Planning.\u201d European J. of Operational Research 111, 448\u2013460.","journal-title":"European J. of Operational Research"},{"key":"3974_CR29","unstructured":"Guignard, M. and K. Spielberg. (1969). \u201cSearch Techniques with Adaptive Features for certain Mixed Integer Programming Problems.\u201d Proceedings of 1968 IFIPS Congress, North Holland."},{"key":"3974_CR30","unstructured":"Guignard, M. and K. Spielberg. (1976). \u201cAn Experimental Interactive System for Integer Programming,\u201d Proceedings, NBS, Bicentennial Conference on MP, Gaithersburg, MD."},{"key":"3974_CR31","unstructured":"Guignard, M. and K. Spielberg. (1977). \u201cPropagation, Penalty Improvement and Logical Inequalities.\u201d Methods of OR (Verlag Hain) 25, 157\u2013171."},{"key":"3974_CR32","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-One Programming (Minimal Preferred Variables).\u201d Op. Res. 29, 49\u201374.","journal-title":"Op. Res"},{"key":"3974_CR33","unstructured":"Guignard, M. and K. Spielberg. (2003). \u201cDouble Contraction, Double Probing, Short Starts, BB Implications,\u201d Working Paper, University of Pennsylvania, Wharton School, OPIM Department (presented at the ALIO\/EURO Workshop, Pucon, Chile, 2002)."},{"key":"3974_CR34","unstructured":"Guignard, M., K. Spielberg, and U. Suhl. (1977). \u201cSurvey of Enumeration Methods for Integer Programming.\u201d Proc. SHARE 51, Boston, 2161\u20132170."},{"key":"3974_CR35","unstructured":"Guignard, M., G. Plateau, and K. Spielberg. (1999). \u201cLogical Processing for MIP; a Review and New Extensions.\u201d Rapport, LIPN; University of Paris 13."},{"key":"3974_CR36","first-page":"421","volume":"26","author":"P. Hammer","year":"1981","unstructured":"Hammer, P. and P. Hansen. (1981). \u201cLogical Relations in Quadratic 0-1 Programming.\u201d Rev. Roum. Math. Pures et Appl. 26, 421\u2013429.","journal-title":"Rev. Roum. Math. Pures et Appl."},{"key":"3974_CR37","doi-asserted-by":"crossref","unstructured":"Hoffman, K. and M. Padberg. (1991). \u201cImproving LP-Representations of Zero-One Linear Programs for Branch-and-Cut.\u201d ORSA J. of Comp. 3.","DOI":"10.1287\/ijoc.3.2.121"},{"key":"3974_CR38","unstructured":"Johnson, E.L. and B. Gopalakrishnan. (2003). \u201cAirline Crew Scheduling; the State-of-the-Art.\u201d Annals of Operations Research 2005 (this volume)."},{"key":"3974_CR39","unstructured":"Johnson, E.L. and K. Spielberg. (1971). \u201cInequalities in Branch and Bound Programming.\u201d IBM Research Report RC 3649, Yorktown Heights, NY."},{"key":"3974_CR40","unstructured":"Johnson, E.L. and K. Spielberg. (2003). \u201cLogical Processing for IP and MIP,\u201d Georgia Institute of Technology Report, pp. 1\u201396."},{"key":"3974_CR41","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.33.4.803","volume":"33","author":"E.L. Johnson","year":"1985","unstructured":"Johnson, E.L., M. Kostreva, and U. Suhl. (1985). \u201cSolving 0-1 Integer Programming Problems Arising from Large Scale Planning Models.\u201d Op. Res. 33, 803\u2013819.","journal-title":"Op. Res."},{"key":"3974_CR42","doi-asserted-by":"crossref","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H. and A.G. Doig. (1960). \u201cAn Automatic Method for Solving Discrete Programming Problems.\u201d Econometrics 28, 497\u2013520.","journal-title":"Econometrics"},{"key":"3974_CR43","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1287\/opre.15.5.892","volume":"15","author":"C. Lemke","year":"1967","unstructured":"Lemke, C. and K. Spielberg. (1967). \u201cDirect Search Algorithms for Zero-One and Mixed Integer Programming.\u201d Op. Res. 15, 892\u2013914.","journal-title":"Op. Res"},{"key":"3974_CR44","doi-asserted-by":"crossref","unstructured":"Lemke, C., H. Salkin, and K. Spielberg. (1971). \u201cSet Covering by Single Branch Enumeration with Linear Programming Subproblems.\u201d OR 19, 998\u20131022; (1969; NY Sc. C. Rep.).","DOI":"10.1287\/opre.19.4.998"},{"key":"3974_CR45","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/opre.49.1.175.11184","volume":"49","author":"R. Lougee-Heimer","year":"2001","unstructured":"Lougee-Heimer, R. (2001). \u201cA Note on Coefficient Adjustment Using SOS Constraints.\u201d Op. Res. 49, 175\u2013177.","journal-title":"Op. Res."},{"key":"3974_CR46","unstructured":"Lougee-Heimer, R. and W.P. Adams. (2003). \u201cA Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs.\u201d Annals of Operations Research 2005 (this volume)."},{"key":"3974_CR47","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1287\/mnsc.24.15.1622","volume":"24","author":"T. Mairs","year":"1978","unstructured":"Mairs, T., G. Wakefield, E. Johnson, and K. Spielberg. (1978). \u201cOn a Production Allocation and Distribution Problem.\u201d Management Science 24, 1622\u20131630.","journal-title":"Management Science"},{"key":"3974_CR48","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1987","unstructured":"Nemhauser, G.L. and L.A. Wolsey. (1987). \u201cInteger and Combinatorial Optimization,\u201d John Wiley & Sons, New York, N.Y."},{"key":"3974_CR49","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. L. Nemhauser","year":"1978","unstructured":"Nemhauser, G. L., L.A. Wolsey, and M.L. Fisher. (1978). \u201cAn Analysis of Approximations for Maximizing Submodular Set Functions-I.\u201d Math. Programming 14, 265\u2013294.","journal-title":"Math. Programming"},{"key":"3974_CR50","unstructured":"Rubin, J. (1971). \u201cAirline Crew Scheduling-the Non-Mathematical Problem,\u201d IBM NY SC. CTR. Rep. 320\u20133006."},{"key":"3974_CR51","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/trsc.7.1.34","volume":"7","author":"J. Rubin","year":"1973a","unstructured":"Rubin, J. (1973a). \u201cA Technique for the Solution of Massive Set Covering Problems, with Applications to Airline Crew Scheduling.\u201d Transportation Science 7, 34\u201348, (NY Sc. C. Rep. 1971).","journal-title":"Transportation Science"},{"key":"3974_CR52","unstructured":"Rubin, J. (1973b). \u201cScheduling of Airline Crews for Aircraft Schedules with Frequency Exceptions.\u201d IBM Cambridge SC. Ctr. Rep."},{"key":"3974_CR53","doi-asserted-by":"crossref","unstructured":"Savelsbergh, M. (1994). \u201cPreprocessing and Probing Techniques for Mixed Integer Programming Problems.\u201d ORSA J. of Comp. 6.","DOI":"10.1287\/ijoc.6.4.445"},{"key":"3974_CR54","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/opre.17.1.85","volume":"17","author":"K. Spielberg","year":"1969","unstructured":"Spielberg, K. (1969). \u201cAlgorithms for the Simple Plant Location Problem with Some Side Conditions.\u201d Op. Res. 17, 85\u2013111.","journal-title":"Op. Res"},{"key":"3974_CR55","unstructured":"Spielberg, K. and M. Guignard. (1999). A Sequential (Pseudo) Hot Start Method for BB (0,1) Mixed Integer Programming, Univ. of Pennsylvania, Wharton School, OPIM Dept. Rep. #99-12-06, augmented by working papers 2000,01,02,03."},{"key":"3974_CR56","unstructured":"Spielberg, K. and U. Suhl. (1980). \u201cAn Experimental Enumeration Software System for Integer Programming,\u201d IBM Research Report RC8219, Yorktown Heights, NY."},{"key":"3974_CR57","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0120693","volume":"2","author":"H.P. Williams","year":"1974","unstructured":"Williams, H.P. (1974). \u201cExperiments in the Formulation of Integer Programming Problems.\u201d Math. Progr. Study 2, 180\u2013197.","journal-title":"Math. Progr. Study"},{"key":"3974_CR58","unstructured":"Williams, H.P. (1978). \u201cModel Building in Mathematical Programming,\u201d Wiley."},{"key":"3974_CR59","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/nav.3800190115","volume":"1","author":"S. Zionts","year":"1972","unstructured":"Zionts, S. (1972). \u201cImplicit Enumeration in Integer Programming,\u201d Naval Logistics Quarterly 1, 165\u2013182.","journal-title":"Naval Logistics Quarterly"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3974-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-3974-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-3974-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:59:35Z","timestamp":1559152775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-3974-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["3974"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-3974-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}