{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T02:13:04Z","timestamp":1784772784600,"version":"3.55.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,31]],"date-time":"2008-05-31T00:00:00Z","timestamp":1212192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10107-008-0226-9","type":"journal-article","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T12:15:48Z","timestamp":1212149748000},"page":"61-104","source":"Crossref","is-referenced-by-count":22,"title":["Lifting inequalities: a framework for generating strong cuts for nonlinear programs"],"prefix":"10.1007","volume":"121","author":[{"given":"Jean-Philippe P.","family":"Richard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,5,31]]},"reference":[{"key":"226_CR1","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":"226_CR2","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":"226_CR3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas E.: Facets of the knapsack polytope. Math. Program. 8, 146\u2013164 (1975)","journal-title":"Math. Program."},{"key":"226_CR4","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E. Balas","year":"1985","unstructured":"Balas E.: Disjunctive programming and hierarchy of relaxations for discrete optimization problems. SIAM J. Alg. Disc. Meth. 6, 466\u2013486 (1985)","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"226_CR5","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1-3), 3\u201344, (1998). Original manuscript was published as a technical report in (1974)","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"226_CR6","first-page":"13","volume":"9","author":"E. Balas","year":"1984","unstructured":"Balas E., Zemel E.: Lifting and complementing yields all the facets of positive zero-one programming polytopes. Math. Program. 9, 13\u201324 (1984)","journal-title":"Math. Program."},{"key":"226_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modelling and Optimization: Methods, Theory and Applications","author":"R.E. Bixby","year":"2000","unstructured":"Bixby R.E., Fenelon M., Gu Z., Rothberg E., Wunderling R.: MIP: theory and practice-closing the gap. In: Powell, M.J.D, Scholtes, S. (eds) System Modelling and Optimization: Methods, Theory and Applications, pp. 19\u201349. Kluwer, Dordrecht (2000)"},{"key":"226_CR8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/1.9780898718805.ch18","volume-title":"The Sharpest Cut: the Impact of Manfred Padberg and His Work, MPS\/SIAM Series on Optimization","author":"R.E. Bixby","year":"2004","unstructured":"Bixby, R.E., Gu, Z., Rothberg, E., Wunderling, R.: Mixed integer programming: a progress report. In: Gr\u00f6tschel, M. (ed.) The Sharpest Cut: the Impact of Manfred Padberg and His Work, MPS\/SIAM Series on Optimization, pp. 309\u2013326. SIAM, Philadelphia (2004)"},{"key":"226_CR9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S. Ceria","year":"1999","unstructured":"Ceria S., Soares J.: Convex programming for disjunctive convex optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"226_CR10","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W. Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W., Pardalos P.M., Prokopyev O.A.: A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper. Res. Lett. 32, 517\u2013522 (2004)","journal-title":"Oper. Res. Lett."},{"key":"226_CR11","unstructured":"Christof, T., L\u00f6bel, A.: PORTA : A POlyhedron Representation Transformation Algorithm (1997). http:\/\/www.zib.de\/Optimization\/Software\/Porta\/"},{"key":"226_CR12","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H.P. Crowder","year":"1983","unstructured":"Crowder H.P., Johnson E.L., Padberg M.W.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"226_CR13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/moor.27.1.210.335","volume":"27","author":"I.R. Farias de","year":"2002","unstructured":"de Farias I.R., Johnson E.L., Nemhauser G.L.: Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210\u2013226 (2002)","journal-title":"Math. Oper. Res."},{"key":"226_CR14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover F., Woolsey E.: Converting a 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22, 180\u2013182 (1974)","journal-title":"Oper. Res."},{"key":"226_CR15","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Lifted flow cover inequalities for mixed 0\u20131 integer programs. Math. Program. 85, 439\u2013468 (1999)","journal-title":"Math. Program."},{"key":"226_CR16","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Gu Z., Nemhauser G.L., Savelsbergh M.W.P.: Sequence independent lifting. J. Comb. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"key":"226_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer P.L., Johnson E.L., Peled U.N.: Facets of regular 0\u20131 polytopes. Math. Program. 8, 179\u2013206 (1975)","journal-title":"Math. Program."},{"key":"226_CR18","volume-title":"Fundamentals of Convex Analysis","author":"J.-B. Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Fundamentals of Convex Analysis. Springer, Heidelberg (2004)"},{"key":"226_CR19","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. Technical Report RRR 2-2007, Rutgers Center for Operations Research, Rutgers University, Piscataway (2007)"},{"key":"226_CR20","unstructured":"Lin, T.-C., Vandenbussche, D.: Boxed-constrained quadratic programs with fixed charge variables. J. Global Optim. (forthcoming)"},{"key":"226_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10479-007-0171-7","volume":"153","author":"Q. Louveaux","year":"2007","unstructured":"Louveaux Q., Wolsey L.A.: Lifting, superadditivity, mixed integer rounding and single node flow sets revisited. Ann. Oper. Res. 153, 47\u201377 (2007)","journal-title":"Ann. Oper. Res."},{"key":"226_CR22","volume-title":"Optimization by Vector Space Methods","author":"D.G. Luenberger","year":"1969","unstructured":"Luenberger D.G.: Optimization by Vector Space Methods. Wiley, New York (1969)"},{"key":"226_CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand H., Wolsey L.A.: The 0\u20131 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"key":"226_CR24","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P.: Computability of global solutions to factorable nonconvex programs: Part I\u2014Convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"226_CR25","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1988)","DOI":"10.1002\/9781118627372"},{"key":"226_CR26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser G.L., Wolsey L.A.: A recursive procedure for generating all cuts for 0\u20131 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"226_CR27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg M.W.: On the facial structure of set packing polyhedra. Math. Program. 5, 199\u2013215 (1973)","journal-title":"Math. Program."},{"key":"226_CR28","first-page":"842","volume":"32","author":"M.W. Padberg","year":"1984","unstructured":"Padberg M.W., Van Roy T.J., Wolsey L.A.: Valid linear inequalities for fixed charge problems. Oper. Res. 32, 842\u2013861 (1984)","journal-title":"Oper. Res."},{"key":"226_CR29","doi-asserted-by":"crossref","unstructured":"Richard, J.-P.P.: Lifted Inequalities for 0\u20131 Mixed Integer Programming. PhD thesis, Georgia Institute of Technology (2002)","DOI":"10.1007\/s10107-003-0399-1"},{"key":"226_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","volume":"98","author":"J.-P.P. Richard","year":"2003","unstructured":"Richard J.-P.P., de Farias I.R., Nemhauser G.L.: Lifted inequalities for 0\u20131 mixed integer programming : Basic theory and algorithms. Math. Program. 98, 89\u2013113 (2003)","journal-title":"Math. Program."},{"key":"226_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-003-0399-1","volume":"98","author":"J.-P.P. Richard","year":"2003","unstructured":"Richard J.-P.P., de Farias I.R., Nemhauser G.L.: Lifted inequalities for 0\u20131 mixed integer programming : superlinear lifting. Math. Program. 98, 115\u2013143 (2003)","journal-title":"Math. Program."},{"key":"226_CR32","volume-title":"Convex Analysis. Princeton Mathematical Series","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis. Princeton Mathematical Series. Princeton University Press, Princeton (1970)"},{"key":"226_CR33","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10107-005-0664-6","volume":"105","author":"S. Shebalov","year":"2006","unstructured":"Shebalov S., Klabjan D.: Sequence independent lifting for mixed integer programs with variable upper bounds. Math. Program. 105, 523\u2013561 (2006)","journal-title":"Math. Program."},{"key":"226_CR34","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali H.D., Adams W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"226_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 of Nonconvex Optimization and its Applications","author":"H.D. Sherali","year":"1999","unstructured":"Sherali H.D., Adams W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 of Nonconvex Optimization and its Applications. Kluwer, Dordrecht (1999)"},{"key":"226_CR36","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Alameddine A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2, 379\u2013410 (1992)","journal-title":"J. Global Optim."},{"key":"226_CR37","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"R. Stubbs","year":"1999","unstructured":"Stubbs R., Mehrotra S.: A branch and cut method for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"226_CR38","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani M., Sahinidis N.V.: Convex extensions and convex envelopes of l.s.c. functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"226_CR39","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(85)90012-4","volume":"4","author":"T.J. Van Roy","year":"1985","unstructured":"Van Roy T.J., Wolsey L.A.: Valid inequalities and separation for uncapacitated fixed charge networks. Oper. Res. Lett. 4, 105\u2013112 (1985)","journal-title":"Oper. Res. Lett."},{"key":"226_CR40","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vandenbussche","year":"2005","unstructured":"Vandenbussche D., Nemhauser G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102, 531\u2013557 (2005)","journal-title":"Math. Program."},{"key":"226_CR41","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A.: Faces for a linear inequality in 0\u20131 variables. Math. Program. 8, 165\u2013178 (1975)","journal-title":"Math. Program."},{"key":"226_CR42","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1976","unstructured":"Wolsey L.A.: Facets and strong valid inequalities for integer programs. Oper. Res. 24, 367\u2013372 (1976)","journal-title":"Oper. Res."},{"key":"226_CR43","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L.A. Wolsey","year":"1977","unstructured":"Wolsey L.A.: Valid inequalities and supperadditivity for 0\u20131 integer programs. Math. Oper. Res. 2, 66\u201377 (1977)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0226-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0226-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0226-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:05Z","timestamp":1559123405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0226-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,31]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0226-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,31]]}}}