{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:08Z","timestamp":1725515288575},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727910"},{"type":"electronic","value":"9783540727927"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72792-7_2","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:07:11Z","timestamp":1182773231000},"page":"16-29","source":"Crossref","is-referenced-by-count":15,"title":["Cuts for Conic Mixed-Integer Programming"],"prefix":"10.1007","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","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","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 Journal on Optimization\u00a05, 13\u201351 (1995)","journal-title":"SIAM Journal on Optimization"},{"key":"2_CR2","doi-asserted-by":"publisher","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. Mathematical Programming\u00a095, 3\u201351 (2003)","journal-title":"Mathematical Programming"},{"key":"2_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\u2013integer programming. Operations Research\u00a052, 487\u2013490 (2004)","journal-title":"Operations Research"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Annals of Discrete Mathematics\u00a05, 3\u201351 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"2_CR5","doi-asserted-by":"publisher","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-1 programs. Mathematical Programming\u00a058, 295\u2013324 (1993)","journal-title":"Mathematical Programming"},{"key":"2_CR6","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia (2001)"},{"key":"2_CR7","doi-asserted-by":"crossref","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 (September 2005)","DOI":"10.2172\/947970"},{"key":"2_CR8","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. Technical Report RC23771, IBM (November 2005)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers, B.: CDSP, a C library for semidefinite programing. Optimization Methods and Software\u00a011, 613\u2013623 (1999)","journal-title":"Optimization Methods and Software"},{"key":"2_CR10","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":"2_CR11","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-1 conic programming. Mathematical Programming\u00a0104, 179\u2013202 (2005)","journal-title":"Mathematical Programming"},{"key":"2_CR12","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"Goemans, M.X.: Semidefinite programming in combinatorial optimization. Mathematical Programming\u00a079, 143\u2013161 (1997)","journal-title":"Mathematical Programming"},{"key":"2_CR13","doi-asserted-by":"publisher","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. Journal of the ACM\u00a042, 1115\u20131145 (1995)","journal-title":"Journal of the ACM"},{"key":"2_CR14","doi-asserted-by":"publisher","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. Optimization Methods and Software\u00a018, 535\u2013541 (2003)","journal-title":"Optimization Methods and Software"},{"key":"2_CR15","doi-asserted-by":"publisher","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 Journal on Optimization\u00a010, 750\u2013778 (2000)","journal-title":"SIAM Journal on Optimization"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.B. Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol.\u00a02081, pp. 293\u2013303. Springer, Heidelberg (2001)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J. Linderoth","year":"2005","unstructured":"Linderoth, J.: A simplical branch-and-bound algorithm for solving quadratically constrained quadratic programs. Mathematical Programming\u00a0103, 251\u2013282 (2005)","journal-title":"Mathematical Programming"},{"key":"2_CR18","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 and its Applications\u00a0284, 193\u2013228 (1998)","journal-title":"Linear Algebra and its Applications"},{"key":"2_CR19","doi-asserted-by":"publisher","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-1 optimization. SIAM Journal on Optimization\u00a01, 166\u2013190 (1991)","journal-title":"SIAM Journal on Optimization"},{"key":"2_CR20","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":"2_CR21","doi-asserted-by":"publisher","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-1 mixed integer programs. Mathematical Programming\u00a046, 379\u2013390 (1990)","journal-title":"Mathematical Programming"},{"key":"2_CR22","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":"2_CR23","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":"2_CR24","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":"2_CR25","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, Philadelphia (1993)"},{"key":"2_CR26","series-title":"Lectures on Econ. Math. Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-48794-1","volume-title":"Optimization with disjunctive constraints","author":"H.D. Sherali","year":"1980","unstructured":"Sherali, H.D., Shetti, C.: Optimization with disjunctive constraints. Lectures on Econ. Math. Systems, vol.\u00a0181. Springer, Heidelberg (1980)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Tun\u00e7bilek, C.H.: A hierarchy of relaxations between continuous and convex hull representations for zero-one programming problems. SIAM Journal on Discrete Mathematics\u00a03, 411\u2013430 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"2_CR28","doi-asserted-by":"publisher","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. Journal of Global Optimization\u00a07, 1\u201331 (1995)","journal-title":"Journal of Global Optimization"},{"key":"2_CR29","doi-asserted-by":"publisher","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-1 mixed convex programming. Mathematical Programming\u00a086, 515\u2013532 (1999)","journal-title":"Mathematical Programming"},{"key":"2_CR30","doi-asserted-by":"publisher","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 ptimization over symmetric cones. Optimization Methods and Software\u00a011, 625\u2013653 (1999)","journal-title":"Optimization Methods and Software"},{"key":"2_CR31","doi-asserted-by":"publisher","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. Mathematical Programming\u00a099, 563\u2013591 (2004)","journal-title":"Mathematical Programming"},{"key":"2_CR32","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11\/12","author":"K.C. Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3 \u2013 a Matlab software package for semidefinite programming. Optimization Methods and Software\u00a011\/12, 545\u2013581 (1999)","journal-title":"Optimization Methods and Software"},{"key":"2_CR33","doi-asserted-by":"publisher","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). Optimization Methods and Software\u00a018, 491\u2013505 (2003)","journal-title":"Optimization Methods and Software"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72792-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T09:40:07Z","timestamp":1707990007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72792-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727910","9783540727927"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72792-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}