{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:14:35Z","timestamp":1778256875594,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,5,9]],"date-time":"2010-05-09T00:00:00Z","timestamp":1273363200000},"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,7]]},"DOI":"10.1007\/s10107-010-0360-z","type":"journal-article","created":{"date-parts":[[2010,5,8]],"date-time":"2010-05-08T06:40:52Z","timestamp":1273300852000},"page":"183-205","source":"Crossref","is-referenced-by-count":130,"title":["Perspective reformulations of mixed integer nonlinear programs with indicator variables"],"prefix":"10.1007","volume":"124","author":[{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeff","family":"Linderoth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,9]]},"reference":[{"key":"360_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, Mathematics and Computer Science Division, Argonne National Lab, 2006"},{"key":"360_CR2","doi-asserted-by":"crossref","unstructured":"Akt\u00fcrk, S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Technical Report BCOL Research Report 07.01, Industrial Engineering & Operations Research, University of California, Berkeley, April 2007. Oper. Res. Lett. 37, 187\u2013191 (2009)","DOI":"10.1016\/j.orl.2008.12.009"},{"key":"360_CR3","doi-asserted-by":"crossref","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Conic mixed integer rounding cuts. Math. Program. (2008) (Forthcoming)","DOI":"10.1007\/s10107-008-0239-4"},{"key":"360_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S., Corneujols G.: A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"360_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization. SIAM, 2001. MPS\/SIAM Series on Optimization","DOI":"10.1137\/1.9780898718829"},{"key":"360_CR6","volume-title":"Data Networks","author":"D. Bertsekas","year":"1987","unstructured":"Bertsekas D., Gallager R.: Data Networks. Endlewood Cliffs, Prentice-Hall (1987)"},{"key":"360_CR7","first-page":"121","volume":"74","author":"D. Bienstock","year":"1996","unstructured":"Bienstock D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"360_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock D., G\u00fcnl\u00fck O.: Capacitated network design\u2014polyhedral structure and computation. ORSA J. Comput. 8, 243\u2013260 (1996)","journal-title":"ORSA J. Comput."},{"key":"360_CR9","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":"360_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TCOM.1977.1093708","volume":"25","author":"R. Boorstyn","year":"1977","unstructured":"Boorstyn R., Frank H.: Large-scale network topological optimization. IEEE Trans. Commun. 25, 29\u201347 (1977)","journal-title":"IEEE Trans. Commun."},{"key":"360_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B. Borchers","year":"1994","unstructured":"Borchers B., Mitchell J.E.: An improved branch and bound algorithm for mixed integer nonlinear programs. Comput. Oper. Res. 21, 359\u2013368 (1994)","journal-title":"Comput. Oper. Res."},{"key":"360_CR12","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 optimization. Math. Program. 86, 595\u2013614 (1999)","journal-title":"Math. Program."},{"key":"360_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10107-005-0578-3","volume":"104","author":"M.T. Cezik","year":"2005","unstructured":"Cezik M.T., Iyengar G.: Cuts for mixed 0-1 conic programming. Math. Program. 104, 179\u2013202 (2005)","journal-title":"Math. Program."},{"key":"360_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","volume":"106","author":"A. Frangioni","year":"2006","unstructured":"Frangioni A., Gentile C.: Perspective cuts for a class of convex 0-1 mixed integer programs. Math. Program. 106, 225\u2013236 (2006)","journal-title":"Math. Program."},{"key":"360_CR15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.orl.2006.03.008","volume":"35","author":"A. Frangioni","year":"2007","unstructured":"Frangioni A., Gentile C.: Sdp diagonalizations and perspective cuts for a class of nonseparable miqp. Oper. Res. Lett. 35, 181\u2013185 (2007)","journal-title":"Oper. Res. Lett."},{"key":"360_CR16","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation, 1960"},{"key":"360_CR17","doi-asserted-by":"crossref","unstructured":"Grossmann, I., Lee S.: Generalized convex disjunctive programming: Nonlinear convex hull relaxation. Comput. Optim. Appl. 83\u2013100 (2003)","DOI":"10.1023\/A:1025154322278"},{"key":"360_CR18","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008: The Thirteenth Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 5035, pp. 1\u201316 (2008)","DOI":"10.1007\/978-3-540-68891-4_1"},{"key":"360_CR19","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed integer nonlinear programs with indicator variables. Technical Report RC24694 (W0811-076), IBM Research Division, November 2008"},{"key":"360_CR20","unstructured":"G\u00fcnl\u00fck, O., Lee, J., Weismantel, R.: MINLP strengthening for separaable convex quadratic transportation-cost ufl. Technical Report RC24213 (W0703-042), IBM Research Division, March 2007"},{"key":"360_CR21","volume-title":"Introduction to Global Optimization","author":"H. Horst","year":"1995","unstructured":"Horst H., Pardalos P.M., Thoai V.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)"},{"key":"360_CR22","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1088\/1469-7688\/1\/5\/301","volume":"1","author":"N.J. Jobst","year":"2001","unstructured":"Jobst N.J., Horniman M.D., Lucas C.A., Mitra G.: Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints. Quant. Finance 1, 489\u2013501 (2001)","journal-title":"Quant. Finance"},{"key":"360_CR23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0098-1354(89)85008-2","volume":"13","author":"G.R. Kocis","year":"1989","unstructured":"Kocis G.R., Grossmann I.E.: Computational experience with DICOPT solving MINLP problems in process systems engineering. Comput. Chem. Eng. 13, 307\u2013315 (1989)","journal-title":"Comput. Chem. Eng."},{"key":"360_CR24","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1147\/rd.513.0489","volume":"51","author":"J. Lee","year":"2007","unstructured":"Lee J.: Mixed-integer nonlinear programming: some modeling and solution issues. IBM J. Res. Dev. 51, 489\u2013497 (2007)","journal-title":"IBM J. Res. Dev."},{"key":"360_CR25","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"23","author":"T. Magnanti","year":"1993","unstructured":"Magnanti T., Mirchandani P.: Shortest paths, single origin-destination network design and associated polyhedra. Networks 23, 103\u2013121 (1993)","journal-title":"Networks"},{"key":"360_CR26","first-page":"77","volume":"7","author":"H.M. Markowitz","year":"1952","unstructured":"Markowitz H.M.: Portfolio selection. J. Finance 7, 77\u201391 (1952)","journal-title":"J. Finance"},{"key":"360_CR27","unstructured":"mosek. The mosek optimization tools manual. version 5.0 (revision 84), 2008. www.mosek.com"},{"key":"360_CR28","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. Nemhauser","year":"1990","unstructured":"Nemhauser G., Wolsey L.: A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."},{"key":"360_CR29","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1287\/mnsc.30.10.1143","volume":"30","author":"A.F. Perold","year":"1984","unstructured":"Perold A.F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143\u20131160 (1984)","journal-title":"Manag. Sci."},{"key":"360_CR30","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"Quesada I., Grossmann I.E.: An LP\/NLP based branch\u2013and\u2013bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"360_CR31","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-1 mixed convex programming. Math. Program. 86, 515\u2013532 (1999)","journal-title":"Math. Program."},{"key":"360_CR32","unstructured":"Stubbs, R.A.: Branch-and-Cut Methods for Mixed 0-1 Convex Programming. PhD thesis, Northwestern University, December 1996"},{"issue":"12","key":"360_CR33","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(12), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"360_CR34","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."},{"issue":"1","key":"360_CR35","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter A., Biegler L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0360-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0360-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0360-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:08Z","timestamp":1559123408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0360-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,9]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["360"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0360-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,9]]}}}