{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T08:09:23Z","timestamp":1763366963948},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,6]],"date-time":"2011-08-06T00:00:00Z","timestamp":1312588800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10589-011-9424-0","type":"journal-article","created":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T15:43:26Z","timestamp":1312559006000},"page":"537-558","source":"Crossref","is-referenced-by-count":52,"title":["Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints"],"prefix":"10.1007","volume":"52","author":[{"given":"Hassan","family":"Hijazi","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Bonami","sequence":"additional","affiliation":[]},{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"additional","affiliation":[]},{"given":"Adam","family":"Ouorou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,6]]},"reference":[{"key":"9424_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 Laboratory (2006)"},{"key":"9424_CR2","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 (2007)"},{"key":"9424_CR3","first-page":"3","volume-title":"Annals of Discrete Mathematics 5: Discrete Optimization","author":"E. Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. In: Annals of Discrete Mathematics 5: Discrete Optimization, pp. 3\u201351. North Holland, Amsterdam (1979)"},{"key":"9424_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 a hierarchy of relaxations for discrete optimization problems. SIAM J. Discrete Math. 6, 466\u2013486 (1985)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9424_CR5","first-page":"94","volume":"1","author":"W. Ben-Ameur","year":"2006","unstructured":"Ben-Ameur, W., Ouorou, A.: Mathematical models of the delay-constrained routing problem. Algorithm. Oper. Res. 1(2), 94\u2013103 (2006)","journal-title":"Algorithm. Oper. Res."},{"key":"9424_CR6","volume-title":"Data Networks","author":"D.P. Bertsekas","year":"1987","unstructured":"Bertsekas, D.P., Gallager, R.G.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)"},{"issue":"2","key":"9424_CR7","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(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"9424_CR8","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":"9424_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"Dakin, R.J.: A tree search algorithm for mixed programming problems. Comput. J. 8, 250\u2013255 (1965)","journal-title":"Comput. J."},{"key":"9424_CR10","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"9424_CR11","unstructured":"Forrest, J.: CBC (2004). Available from http:\/\/www.coin-or.org\/"},{"issue":"2","key":"9424_CR12","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\u20131 mixed-integer programs. Math. Program. 106(2), 225\u2013236 (2006)","journal-title":"Math. Program."},{"key":"9424_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"I. Grossmann","year":"2003","unstructured":"Grossmann, I., Lee, S.: Generalized convex disjunctive programming: nonlinear convex hull relaxation. Comput. Optim. Appl. 26, 83\u2013100 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9424_CR14","first-page":"1","volume-title":"Lect. Notes Comput. Sci.","author":"O. G\u00fcnl\u00fck","year":"2008","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective relaxation of mixed-integer nonlinear programs with indicator variables. In: Lect. Notes Comput. Sci., vol.\u00a05035, pp.\u00a01\u201316 (2008)"},{"key":"9424_CR15","series-title":"Electronic Notes in Discrete Mathematics","first-page":"1153","volume-title":"Proceedings of ISCO 2010\u2014International Symposium on Combinatorial Optimization","author":"H. Hijazi","year":"2010","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed integer non-linear programs featuring \u201con\/off\u201d constraints: convex analysis and application. In: Proceedings of ISCO 2010\u2014International Symposium on Combinatorial Optimization. Electronic Notes in Discrete Mathematics, vol. 36, pp. 1153\u20131160 (2010)"},{"key":"9424_CR16","unstructured":"Hijazi, H.: Mixed integer non-linear optimization approaches for network design in telecommunications. Ph.D. Thesis, Universit\u00e9 d\u2019Aix Marseille, November 2010"},{"issue":"1, 2","key":"9424_CR17","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1015441400785","volume":"20","author":"J.G. Klincewicz","year":"2002","unstructured":"Klincewicz, J.G., Schmitt, J.: Incorporating qos into ip enterprise network design. Telecommun. Syst. 20(1, 2), 81\u2013106 (2002)","journal-title":"Telecommun. Syst."},{"issue":"2","key":"9424_CR18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10288-002-0010-2","volume":"1","author":"E. Martins","year":"2003","unstructured":"Martins, E., Pascoal, M.: A new implementation of yen\u2019s ranking loopless paths algorithm. 4OR 1(2), 121\u2013133 (2003)","journal-title":"4OR"},{"key":"9424_CR19","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-and-bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16, 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"key":"9424_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-30165-5","volume-title":"Handbook of Optimization in Telecommunications","author":"M.G.C. Resende","year":"2006","unstructured":"Resende, M.G.C., Pardalos, P.M.: Handbook of Optimization in Telecommunications. Springer, Berlin (2006). Chap.\u00a017 by J.G. Klincewicz"},{"key":"9424_CR21","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."},{"issue":"1","key":"9424_CR22","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."},{"key":"9424_CR23","doi-asserted-by":"crossref","first-page":"s131","DOI":"10.1016\/0098-1354(95)00164-W","volume":"19","author":"T. Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: A cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, s131\u2013s136 (1995)","journal-title":"Comput. Chem. Eng."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9424-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9424-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9424-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:41Z","timestamp":1559302601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9424-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9424"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9424-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,6]]}}}