{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T08:00:25Z","timestamp":1768896025773,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,21]],"date-time":"2008-08-21T00:00:00Z","timestamp":1219276800000},"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,3]]},"DOI":"10.1007\/s10107-008-0239-4","type":"journal-article","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:13:40Z","timestamp":1219234420000},"page":"1-20","source":"Crossref","is-referenced-by-count":89,"title":["Conic mixed-integer rounding cuts"],"prefix":"10.1007","volume":"122","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]},{"given":"Vishnu","family":"Narayanan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,21]]},"reference":[{"key":"239_CR1","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.T.: FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. Preprint ANL\/MCS-P1374-0906, Argonne National Laboratory, Mathematics and Computer Science Division, September 2006"},{"key":"239_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh F.: Interior point methods in semidefinite programming and applications to combinatorial optimization. SIAM J. Optim. 5, 13\u201351 (1995)","journal-title":"SIAM J. Optim."},{"key":"239_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F. Alizadeh","year":"2003","unstructured":"Alizadeh F., Goldfarb D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"239_CR4","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Lifting for conic mixed-integer programming. Technical Report BCOL.07.04, IEOR, University of California-Berkeley, October 2007"},{"key":"239_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E.: Disjunctive Programming. Ann. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discrete Math."},{"key":"239_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"239_CR7","doi-asserted-by":"crossref","first-page":"333","DOI":"10.2307\/2330390","volume":"13","author":"S. Baum","year":"1978","unstructured":"Baum S., Carlson R.C., Jucker J.V.: Some problems in applying the continuous portfolio selection model to the discrete capital budgeting problem. J. Financ. Quant. Anal. 13, 333\u2013344 (1978)","journal-title":"J. Financ. Quant. Anal."},{"key":"239_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia, 2001","DOI":"10.1137\/1.9780898718829"},{"key":"239_CR9","unstructured":"Benson, S.J., Ye, Y.: DSDP5: Software for semidefinite programming. Technical Report ANL\/MCS-P1289-0905, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, September 2005. ACM Transactions on Mathematical Software (submitted)"},{"key":"239_CR10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P. Bonami","year":"2008","unstructured":"Bonami P., Biegler L.T., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., Lee J., Lodi A., Margot F., Sawaya N., W\u00e4chter A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"239_CR11","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: CSDP, a C library for semidefinite programing. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"239_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd S., Vandenberghe L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"239_CR13","doi-asserted-by":"crossref","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":"239_CR14","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"Goemans M.X.: Semidefinite programming in combinatorial optimization. Math. Program. 79, 143\u2013161 (1997)","journal-title":"Math. Program."},{"key":"239_CR15","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfyibility problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"239_CR16","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960)"},{"key":"239_CR17","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1080\/1055678031000148696","volume":"18","author":"S. Kim","year":"2003","unstructured":"Kim S., Kojima M., Yamashita M.: Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18, 535\u2013451 (2003)","journal-title":"Optim. Methods Softw."},{"key":"239_CR18","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M. Kojima","year":"2000","unstructured":"Kojima M., Tuncel L.: Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10, 750\u2013778 (2000)","journal-title":"SIAM J. Optim."},{"key":"239_CR19","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0\u20131 programs. In: Aardal, K., Gerards, A.M.H. (eds.) Lecture Notes in Computer Science, vol. 2081, pp. 293\u2013303 (2001)","DOI":"10.1007\/3-540-45535-3_23"},{"key":"239_CR20","doi-asserted-by":"crossref","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":"239_CR21","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L., Schrijver A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"239_CR22","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1109\/TCOMM.2004.826349","volume":"52","author":"J. Luo","year":"2004","unstructured":"Luo J., Pattipati K.R., Willett P., Levchuk G.M.: Optimal and suboptimal any-time algorithms for cdma multiuser detection based on branch and bound. IEEE Trans. Commun. 52, 632\u2013642 (2004)","journal-title":"IEEE Trans. Commun."},{"key":"239_CR23","first-page":"117","volume":"97","author":"Z.-Q. Luo","year":"2003","unstructured":"Luo Z.-Q.: Applications of convex optimization in signal processing and digital communication. Math. Program. 97, 117\u2013207 (2003)","journal-title":"Math. Program."},{"key":"239_CR24","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, 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"239_CR25","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2307\/2330649","volume":"16","author":"R.D. McBride","year":"1981","unstructured":"McBride R.D.: Finding the integer efficient frontier for quadratic capital budgeting problems. J. Financ. Quant. Anal. 16, 247\u2013253 (1981)","journal-title":"J. Financ. Quant. Anal."},{"key":"239_CR26","doi-asserted-by":"crossref","first-page":"3869","DOI":"10.1109\/TIT.2007.907472","volume":"53","author":"A. Mobasher","year":"2007","unstructured":"Mobasher A., Taherzadeh M., Khandani A.K.: A near-maximum likelihood decoding algorithm for MIMO systems based on semi-definite programming. IEEE Trans. Inform. Theory 53, 3869\u20133886 (2007)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"239_CR27","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. John Wiley and Sons, New York (1988)"},{"key":"239_CR28","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":"239_CR29","unstructured":"Nesterov, Y., Nemirovski, A.: A general approach to polynomial-time algorithm design for convex programming. Technical report, Center. Econ. Math. Inst, USSR Acad. Sci., Moskow, USSR (1988)"},{"key":"239_CR30","unstructured":"Nesterov, Y., Nemirovski, A.: Self-concordant functions and polynomial time methods in convex programming. Technical report, Center. Econ. Math. Inst, USSR Acad. Sci., Moskow, USSR (1990)"},{"key":"239_CR31","unstructured":"Nesterov, Y., Nemirovski, A.: Conic formulation of a convex programming problem and duality. Technical report, Center. Econ. Math. Inst, USSR Acad. Sci., Moskow, USSR (1991)"},{"key":"239_CR32","volume-title":"Interior-Point Polynomial Algorithms for Convex Programming","author":"Y. Nesterov","year":"1993","unstructured":"Nesterov Y., Nemirovski A.: Interior-Point Polynomial Algorithms for Convex Programming. SIAM, Philedelphia (1993)"},{"key":"239_CR33","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1987)"},{"key":"239_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.: 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":"239_CR35","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Shetti, C.: Optimization with disjunctive constraints, vol. 181 of Lectures on Econ. Math. Systems. Springer Verlag, Berlin, Heidelberg, New York (1980)","DOI":"10.1007\/978-3-642-48794-1"},{"key":"239_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H.D. Sherali","year":"1995","unstructured":"Sherali H.D., Tun\u00e7bilek C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7, 1\u201331 (1995)","journal-title":"J. Global Optim."},{"key":"239_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 methods for 0\u20131 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"239_CR38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/A:1020351410169","volume":"24","author":"R. Stubbs","year":"2002","unstructured":"Stubbs R., Mehrotra S.: Generating convex polynomial inequalities for mixed 0-\u20131 programs. J. Global Optim. 24, 311\u2013332 (2002)","journal-title":"J. Global Optim."},{"key":"239_CR39","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J. Sturm","year":"1999","unstructured":"Sturm J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"239_CR40","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"239_CR41","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M. Tawarmalani","year":"2005","unstructured":"Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"239_CR42","doi-asserted-by":"crossref","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming. Optimization Methods and Software, vol. 11\/12, pp. 545\u2013581 (1999)","DOI":"10.1080\/10556789908805762"},{"key":"239_CR43","doi-asserted-by":"crossref","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed integer conic quadratic programs. Manuscript, Georgia Institute of Technology (2007)","DOI":"10.1287\/ijoc.1070.0256"},{"key":"239_CR44","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1287\/mnsc.12.7.485","volume":"12","author":"H.M. Weingartner","year":"1966","unstructured":"Weingartner H.M.: Capital budgeting of interrelated projects: survey and synthesis. Manage. Sci. 12, 485\u2013516 (1966)","journal-title":"Manage. Sci."},{"key":"239_CR45","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M. Yamashita","year":"2003","unstructured":"Yamashita M., Fujisawa K., Kojima M.: Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0). Optim. Methods Softw. 18, 491\u2013505 (2003)","journal-title":"Optim. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0239-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0239-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0239-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T20:32:08Z","timestamp":1588883528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0239-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,21]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["239"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0239-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,21]]}}}