{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:19:20Z","timestamp":1761895160258},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642155819"},{"type":"electronic","value":"9783642155826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15582-6_50","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T05:15:44Z","timestamp":1284095744000},"page":"303-314","source":"Crossref","is-referenced-by-count":9,"title":["The Reformulation-Optimization Software Engine"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Cafieri","sequence":"additional","affiliation":[]},{"given":"David","family":"Savourey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"50_CR1","volume-title":"The AMPL Book","author":"R. Fourer","year":"2002","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"},{"issue":"1","key":"50_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1147\/rd.471.0057","volume":"47","author":"R. Lougee-Heimer","year":"2003","unstructured":"Lougee-Heimer, R.: The common optimization interface for operations research: Promoting open-source software in the operations research community. IBM Journal of Research and Development\u00a047(1), 57\u201366 (2003)","journal-title":"IBM Journal of Research and Development"},{"key":"50_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/0-387-30528-9_8","volume-title":"Global Optimization: from Theory to Implementation","author":"L. Liberti","year":"2006","unstructured":"Liberti, L.: Writing global optimization software. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, pp. 211\u2013262. Springer, Berlin (2006)"},{"issue":"4","key":"50_CR4","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P. Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optimization Methods and Software\u00a024(4), 597\u2013634 (2009)","journal-title":"Optimization Methods and Software"},{"issue":"4","key":"50_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10898-005-0937-x","volume":"33","author":"H. Schichl","year":"2005","unstructured":"Schichl, H., Neumaier, A.: Interval analysis on directed acyclic graphs for global optimization. Journal of Global Optimization\u00a033(4), 541\u2013562 (2005)","journal-title":"Journal of Global Optimization"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","volume-title":"Combinatorics and Computer Science","author":"K. Fukuda","year":"1996","unstructured":"Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol.\u00a01120, pp. 91\u2013111. Springer, Heidelberg (1996)"},{"key":"50_CR7","unstructured":"Christof, T., L\u00f6bel, A.: The porta manual page. Technical Report v.\u00a01.4.0, ZIB, Berlin (1997)"},{"key":"50_CR8","unstructured":"Sahinidis, N., Tawarmalani, M.: BARON 7.2.5: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2005)"},{"issue":"3-4","key":"50_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/58859.58863","volume":"23","author":"A. Brook","year":"1988","unstructured":"Brook, A., Kendrick, D., Meeraus, A.: GAMS, a user\u2019s guide. ACM SIGNUM Newsletter\u00a023(3-4), 10\u201311 (1988)","journal-title":"ACM SIGNUM Newsletter"},{"key":"50_CR10","unstructured":"Orban, D., Fourer, R.: Dr.\u00a0AMPL: a meta solver for optimization (2004) (Presentation slides)"},{"issue":"4","key":"50_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s12532-009-0008-2","volume":"1","author":"M. Colombo","year":"2009","unstructured":"Colombo, M., Grothey, A., Hogg, J., Woodsend, K., Gondzio, J.: A structure-conveying modelling language for mathematical and stochastic programming. Mathematical Programming Computation\u00a01(4), 223\u2013247 (2009)","journal-title":"Mathematical Programming Computation"},{"issue":"14","key":"50_CR12","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1016\/j.dam.2006.05.012","volume":"155","author":"S. Kucherenko","year":"2007","unstructured":"Kucherenko, S., Belotti, P., Liberti, L., Maculan, N.: New formulations for the kissing number problem. Discrete Applied Mathematics\u00a0155(14), 1837\u20131841 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"50_CR13","unstructured":"Maculan, N., Michelon, P., MacGregor Smith, J.: Bounds on the kissing numbers in \u211dn: Mathematical programming formulations. Technical report, University of Massachusetts, Amherst, USA (1996)"},{"key":"50_CR14","unstructured":"Gill, P.: User\u2019s guide for SNOPT version 7. Systems Optimization Laboratory, Stanford University, California (2006)"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Symmetry in mathematical programming. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, vol.\u00a0IMA, Springer, New York (accepted)","DOI":"10.1007\/978-1-4614-1927-3_9"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C. Bachoc","year":"2008","unstructured":"Bachoc, C., Vallentin, F.: New upper bounds for kissing numbers from semidefinite programming. Journal of the American Mathematical Society\u00a021, 909\u2013924 (2008)","journal-title":"Journal of the American Mathematical Society"},{"issue":"1","key":"50_CR17","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L. Liberti","year":"2009","unstructured":"Liberti, L.: Reformulations in mathematical programming: Definitions and systematics. RAIRO-RO\u00a043(1), 55\u201386 (2009)","journal-title":"RAIRO-RO"},{"key":"50_CR18","series-title":"SCI","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-642-01085-9_7","volume-title":"Foundations of Computational Intelligence","author":"L. Liberti","year":"2009","unstructured":"Liberti, L., Cafieri, S., Tarissan, F.: Reformulations in mathematical programming: A computational approach. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence. SCI, vol.\u00a03, 203, pp. 153\u2013234. Springer, Berlin (2009)"},{"key":"50_CR19","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet, R.: Applications de l\u2019alg\u00e8bre de Boole en recherche op\u00e9rationelle. Revue Fran\u00e7aise de Recherche Op\u00e9rationelle\u00a04, 17\u201326 (1960)","journal-title":"Revue Fran\u00e7aise de Recherche Op\u00e9rationelle"},{"key":"50_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"E. Smith","year":"1999","unstructured":"Smith, E., Pantelides, C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering\u00a023, 457\u2013478 (1999)","journal-title":"Computers & Chemical Engineering"},{"key":"50_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-13193-6_30","volume-title":"Experimental Algorithms","author":"C. D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with a feasibility pump approach for nonconvex MINLPs. In: Festa, P. (ed.) Experimental Algorithms. LNCS, vol.\u00a06049, pp. 350\u2013360. Springer, Heidelberg (2010)"},{"key":"50_CR22","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming\u00a098, 23\u201337 (2005)","journal-title":"Mathematical Programming"},{"key":"50_CR23","unstructured":"McKay, B.: Nauty User\u2019s Guide (Version 2.4). Computer Science Dept., Australian National University (2007)"},{"key":"50_CR24","unstructured":"The GAP\u00a0Group: GAP \u2013 Groups, Algorithms, and Programming, Version 4.4.10 (2007)"},{"key":"50_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1111\/j.1475-3995.2008.00604.x","volume":"15","author":"L. Liberti","year":"2008","unstructured":"Liberti, L.: Spherical cuts for integer programming problems. International Transactions in Operational Research\u00a015, 283\u2013294 (2008)","journal-title":"International Transactions in Operational Research"},{"key":"50_CR26","series-title":"Lecture Notes in Decision Sciences","first-page":"999","volume-title":"Global Optimization: Theory, Methods and Applications I","author":"S. Cafieri","year":"2009","unstructured":"Cafieri, S., Lee, J., Liberti, L.: Comparison of convex relaxations of quadrilinear terms. In: Ma, C., Yu, L., Zhang, D., Zhou, Z. (eds.) Global Optimization: Theory, Methods and Applications I. Lecture Notes in Decision Sciences, vol.\u00a012(B), pp. 999\u20131005. Global-Link Publishers, Hong Kong (2009)"},{"key":"50_CR27","doi-asserted-by":"crossref","unstructured":"Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. Journal of Global Optimization, doi: 10.1007\/s10898-009-9484-1","DOI":"10.1007\/s10898-009-9484-1"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulations in mathematical programming: Automatic symmetry detection and exploitation. Mathematical Programming, doi: 10.1007\/s10107-010-0351-0","DOI":"10.1007\/s10107-010-0351-0"},{"key":"50_CR29","doi-asserted-by":"crossref","unstructured":"Costa, A., Hansen, P., Liberti, L.: Formulation symmetries in circle packing. In: Mahjoub, R. (ed.) Proceedings of the International Symposium on Combinatorial Optimization. Electronic Notes in Discrete Mathematics. Elsevier, Amsterdam (accepted)","DOI":"10.1016\/j.endm.2010.05.165"},{"key":"50_CR30","unstructured":"Costa, A., Hansen, P., Liberti, L.: Static symmetry breaking in circle packing. In: Faigle, U. (ed.) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, University of K\u00f6ln (2010)"},{"key":"50_CR31","series-title":"Annals of Information Systems","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-1-4419-1306-7_9","volume-title":"Hybridizing metaheuristics and mathematical programming","author":"L. Liberti","year":"2009","unstructured":"Liberti, L., Mladenovi\u0107, N., Nannicini, G.: A good recipe for solving MINLPs. In: Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.) Hybridizing metaheuristics and mathematical programming. Annals of Information Systems, vol.\u00a010, pp. 231\u2013244. Springer, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15582-6_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:58:23Z","timestamp":1619773103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15582-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155819","9783642155826"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15582-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}