{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:10:11Z","timestamp":1761621011765},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T00:00:00Z","timestamp":1242691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s10107-009-0282-9","type":"journal-article","created":{"date-parts":[[2009,5,18]],"date-time":"2009-05-18T10:47:34Z","timestamp":1242643654000},"page":"351-363","source":"Crossref","is-referenced-by-count":33,"title":["Lifting for conic mixed-integer programming"],"prefix":"10.1007","volume":"126","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vishnu","family":"Narayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"282_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"M.S. Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk M.S., Atamt\u00fcrk A., G\u00fcrel S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Research Report BCOL.07.01, IEOR, University of California-Berkeley, April 2007. Oper. Res. Lett. 37, 187\u2013191 (2009). doi: 10.1016\/j.orl.2008.12.009","journal-title":"Oper. Res. Lett."},{"key":"282_CR2","doi-asserted-by":"publisher","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 mixed-integer knapsack polyhedron. Math. Program. 98, 145\u2013175 (2003). doi: 10.1007\/s10107-003-0400-z","journal-title":"Math. Program."},{"key":"282_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004). doi: 10.1287\/opre.1030.0099","journal-title":"Oper. Res."},{"key":"282_CR4","doi-asserted-by":"publisher","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed-integer rounding cuts. Research Report BCOL.06.03, IEOR, University of California-Berkeley, December 2006. Math. Program. (2008). doi: 10.1007\/s10107-008-0239-4","DOI":"10.1007\/s10107-008-0239-4"},{"key":"282_CR5","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: The submodular 0\u20131 knapsack polytope. Research Report BCOL.08.03, IEOR, University of California-Berkeley, June 2008. Discrete Optim. (forthcoming)"},{"key":"282_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal A., Nemirovski A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001a)"},{"key":"282_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/moor.26.2.193.10561","volume":"26","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal A., Nemirovski A.: On polyhedral approximations of the second-order cone. Math. Oper. Res. 26, 193\u2013205 (2001b)","journal-title":"Math. Oper. Res."},{"key":"282_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M.T. \u00c7ezik","year":"2005","unstructured":"\u00c7ezik M.T., Iyengar G.: Cuts for mixed 0\u20131 conic programming. Math. Program. 104, 179\u2013202 (2005)","journal-title":"Math. Program."},{"key":"282_CR9","doi-asserted-by":"publisher","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 in mixed integer programming. J. Comb. Optim. 4, 109\u2013129 (2000)","journal-title":"J. Comb. Optim."},{"key":"282_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0024-3795(98)10032-0","volume":"284","author":"M. Lobo","year":"1998","unstructured":"Lobo M., Vandenberghe L., Boyd S., Lebret H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193\u2013228 (1998)","journal-title":"Linear Algebra Appl."},{"key":"282_CR11","doi-asserted-by":"publisher","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":"282_CR12","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1979","unstructured":"Padberg M.W.: A note on 0\u20131 programming. Oper. Res. 23, 833\u2013837 (1979)","journal-title":"Oper. Res."},{"key":"282_CR13","doi-asserted-by":"publisher","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 (2003a)","journal-title":"Math. Program."},{"key":"282_CR14","doi-asserted-by":"publisher","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 (2003b)","journal-title":"Math. Program."},{"key":"282_CR15","doi-asserted-by":"crossref","unstructured":"Richard, J.-P.P., Tawarmalani, M.: Lifting inequalities: a framework for generating strong cuts for nonlinear programs. Manuscript, Purdue University, March 2007. Math. Program. (forthcoming)","DOI":"10.1007\/s10107-008-0226-9"},{"key":"282_CR16","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"J.P. Vielma","year":"2008","unstructured":"Vielma J.P., Ahmed S., Nemhauser G.L.: A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. INFORMS J. Comput. 20, 438\u2013450 (2008)","journal-title":"INFORMS J. Comput."},{"key":"282_CR17","doi-asserted-by":"publisher","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":"282_CR18","doi-asserted-by":"publisher","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 superadditivity for 0\/1 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-009-0282-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0282-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0282-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0282-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:26:28Z","timestamp":1558315588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0282-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,19]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["282"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0282-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,19]]}}}