{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T10:32:50Z","timestamp":1764239570990},"publisher-location":"Berlin, Heidelberg","reference-count":134,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010842"},{"type":"electronic","value":"9783642010859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01085-9_7","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:55:34Z","timestamp":1241456134000},"page":"153-234","source":"Crossref","is-referenced-by-count":36,"title":["Reformulations in Mathematical Programming: A Computational Approach"],"prefix":"10.1007","author":[{"given":"Leo","family":"Liberti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Cafieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Tarissan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"W. Adams","year":"2004","unstructured":"Adams, W., Forrester, R., Glover, F.: Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs. Discrete Optimization\u00a01, 99\u2013120 (2004)","journal-title":"Discrete Optimization"},{"issue":"10","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W. Adams","year":"1986","unstructured":"Adams, W., Sherali, H.: A tight linearization and an algorithm for 0-1 quadratic programming problems. Management Science\u00a032(10), 1274\u20131290 (1986)","journal-title":"Management Science"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10479-005-3966-4","volume":"140","author":"W. Adams","year":"2005","unstructured":"Adams, W., Sherali, H.: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Annals of Operations Research\u00a0140, 21\u201347 (2005)","journal-title":"Annals of Operations Research"},{"issue":"9","key":"7_CR4","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"C. Adjiman","year":"1998","unstructured":"Adjiman, C., Dallwig, S., Floudas, C., Neumaier, A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs: I. Theoretical advances. Computers & Chemical Engineering\u00a022(9), 1137\u20131158 (1998)","journal-title":"Theoretical advances. Computers & Chemical Engineering"},{"issue":"9","key":"7_CR5","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"C.S. Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs: II. Implementation and computational results. Computers & Chemical Engineering\u00a022(9), 1159\u20131179 (1998)","journal-title":"Implementation and computational results. Computers & Chemical Engineering"},{"key":"7_CR6","volume-title":"Data Structures and Algorithms","author":"A. Aho","year":"1983","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F., Falk, J.: Jointly constrained biconvex programming. Mathematics of Operations Research\u00a08(2), 273\u2013286 (1983)","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"7_CR8","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 with applications to combinatorial optimization. SIAM Journal on Optimization\u00a05(1), 13\u201351 (1995)","journal-title":"SIAM Journal on Optimization"},{"issue":"11","key":"7_CR9","doi-asserted-by":"publisher","first-page":"1720","DOI":"10.1287\/mnsc.1050.0382","volume":"51","author":"K. Andersen","year":"2005","unstructured":"Andersen, K., Cornu\u00e9jols, G., Li, Y.: Reduce-and-split cuts: Improving the performance of mixed-integer Gomory cuts. Management Science\u00a051(11), 1720\u20131732 (2005)","journal-title":"Management Science"},{"issue":"4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"I.P. Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: alphaBB: A global optimization method for general constrained nonconvex problems. Journal of Global Optimization\u00a07(4), 337\u2013363 (1995)","journal-title":"Journal of Global Optimization"},{"key":"7_CR11","unstructured":"Anstreicher, K.: SDP versus RLT for nonconvex QCQPs. In: Floudas, C., Pardalos, P. (eds.) Proceedings of Advances in Global Optimization: Methods and Applications, Mykonos, Greece (2007)"},{"key":"7_CR12","volume-title":"The Travelling Salesman Problem: a Computational Study","author":"D. Applegate","year":"2007","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: The Travelling Salesman Problem: a Computational Study. Princeton University Press, Princeton (2007)"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022645805569","volume":"93","author":"C. Audet","year":"1997","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications\u00a093(2), 273\u2013300 (1997)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts \u2014 a new type of cutting planes for integer programming. Operations Research\u00a019(1), 19\u201339 (1971)","journal-title":"Operations Research"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10479-005-3969-1","volume":"140","author":"E. Balas","year":"2005","unstructured":"Balas, E.: Projection, lifting and extended formulation in integer and combinatorial optimization. Annals of Operations Research\u00a0140, 125\u2013161 (2005)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1137\/0123007","volume":"23","author":"E. Balas","year":"1972","unstructured":"Balas, E., Jeroslow, R.: Canonical cuts on the unit hypercube. SIAM Journal on Applied Mathematics\u00a023(1), 61\u201369 (1972)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jsco.2001.0494","volume":"33","author":"C. Bauer","year":"2002","unstructured":"Bauer, C., Frink, A., Kreckel, R.: Introduction to the ginac framework for symbolic computation within the C++ programming language. Journal of Symbolic Computation\u00a033(1), 1\u201312 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"7_CR18","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bound reduction techniques for non-convex MINLP. Optimization Methods and Software (submitted)"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/S0098-1354(02)00254-5","volume":"27","author":"K.M. Bj\u00f6rk","year":"2003","unstructured":"Bj\u00f6rk, K.M., Lindberg, P., Westerlund, T.: Some convexifications in global optimization of problems containing signomial terms. Computers & Chemical Engineering\u00a027, 669\u2013679 (2003)","journal-title":"Computers & Chemical Engineering"},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0098-1354(99)80004-0","volume":"23","author":"J. Bjorkqvist","year":"1999","unstructured":"Bjorkqvist, J., Westerlund, T.: Automated reformulation of disjunctive constraints in MINLP optimization. Computers & Chemical Engineering\u00a023, S11\u2013S14 (1999)","journal-title":"Computers & Chemical Engineering"},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"E. Boyd","year":"1994","unstructured":"Boyd, E.: Fenchel cutting planes for integer programs. Operations Research\u00a042(1), 53\u201364 (1994)","journal-title":"Operations Research"},{"key":"7_CR22","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)"},{"issue":"3-4","key":"7_CR23","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":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/978-3-540-30214-8_19","volume-title":"Discovery Science","author":"G. Caporossi","year":"2004","unstructured":"Caporossi, G., Alamargot, D., Chesnet, D.: Using the computer to study the dyamics of the handwriting processes. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol.\u00a03245, pp. 242\u2013254. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0086-0","volume":"112","author":"G. Cornu\u00e9jols","year":"2008","unstructured":"Cornu\u00e9jols, G.: Valid inequalities for mixed integer linear programs. Mathematical Programming B\u00a0112(1), 3\u201344 (2008)","journal-title":"Mathematical Programming B"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11966104_6","volume-title":"Software Architecture","author":"V. Cortellessa","year":"2006","unstructured":"Cortellessa, V., Marinelli, F., Potena, P.: Automated selection of software components based on cost\/reliability tradeoff. In: Gruhn, V., Oquendo, F. (eds.) EWSA 2006. LNCS, vol.\u00a04344, pp. 66\u201381. Springer, Heidelberg (2006)"},{"key":"7_CR27","volume-title":"Linear Programming and Extensions","author":"G. Dantzig","year":"1963","unstructured":"Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"7_CR28","unstructured":"Davidovi\u0107, T., Liberti, L., Maculan, N., Mladenovi\u0107, N.: Towards the optimal solution of the multiprocessor scheduling problem with communication delays. In: MISTA Proceedings (2007)"},{"key":"7_CR29","unstructured":"Dhyani, K.: Personal communication (2007)"},{"key":"7_CR30","unstructured":"Di Giacomo, L.: Mathematical programming methods in dynamical nonlinear stochastic supply chain management. Ph.D. thesis, DSPSA, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (2007)"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M. Duran","year":"1986","unstructured":"Duran, M., Grossmann, I.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming\u00a036, 307\u2013339 (1986)","journal-title":"Mathematical Programming"},{"key":"7_CR32","first-page":"47","volume":"70","author":"J. Falk","year":"1995","unstructured":"Falk, J., Liu, J.: On bilevel programming, part I: General nonlinear cases. Mathematical Programming\u00a070, 47\u201372 (1995)","journal-title":"Mathematical Programming"},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"J. Falk","year":"1969","unstructured":"Falk, J., Soland, R.: An algorithm for separable nonconvex programming problems. Management Science\u00a015, 550\u2013569 (1969)","journal-title":"Management Science"},{"issue":"2","key":"7_CR34","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"A. Fischer","year":"1998","unstructured":"Fischer, A.: New constrained optimization reformulation of complementarity problems. Journal of Optimization Theory and Applications\u00a099(2), 481\u2013507 (1998)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"7_CR35","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R. Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming\u00a066, 327\u2013349 (1994)","journal-title":"Mathematical Programming"},{"key":"7_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4949-6","volume-title":"Deterministic Global Optimization","author":"C. Floudas","year":"2000","unstructured":"Floudas, C.: Deterministic Global Optimization. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"7_CR37","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":"7_CR38","unstructured":"Fourer, R.: Personal communication (2004)"},{"key":"7_CR39","unstructured":"Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)"},{"key":"7_CR40","unstructured":"Galli, S.: Parsing AMPL internal format for linear and non-linear expressions, B.Sc.\u00a0dissertation, DEI, Politecnico di Milano, Italy (2004)"},{"key":"7_CR41","unstructured":"Gill, P.: User\u2019s Guide for SNOPT 5.3. Systems Optimization Laboratory, Department of EESOR, Stanford University, California (1999)"},{"key":"7_CR42","volume-title":"Systems Optimization Laboratory","author":"P. Gill","year":"2006","unstructured":"Gill, P.: User\u2019s guide for SNOPT version 7. In: Systems Optimization Laboratory. Stanford University, California (2006)"},{"issue":"5","key":"7_CR43","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R. Gomory","year":"1958","unstructured":"Gomory, R.: Essentials of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society\u00a064(5), 256 (1958)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti and Maculan [79], pp. 155\u2013210","DOI":"10.1007\/0-387-30528-9_7"},{"key":"7_CR45","unstructured":"Gu\u00e9ret, C., Prins, C., Sevaux, M.: Applications of optimization with Xpress-MP. Dash Optimization, Bilsworth (2000)"},{"key":"7_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"P. Hammer","year":"1968","unstructured":"Hammer, P., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer, Berlin (1968)"},{"key":"7_CR47","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Method of non-linear 0-1 programming. Annals of Discrete Mathematics\u00a05, 53\u201370 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"7_CR48","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1111237.1111238","volume":"25","author":"C. Haverly","year":"1978","unstructured":"Haverly, C.: Studies of the behaviour of recursion for the pooling problem. ACM SIGMAP Bulletin\u00a025, 19\u201328 (1978)","journal-title":"ACM SIGMAP Bulletin"},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/0377-2217(84)90107-3","volume":"15","author":"R. Horst","year":"1984","unstructured":"Horst, R.: On the convexification of nonlinear programming problems: an applications-oriented approach. European Journal of Operations Research\u00a015, 382\u2013392 (1984)","journal-title":"European Journal of Operations Research"},{"key":"7_CR50","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"7_CR51","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/0-387-25570-2_3","volume-title":"Essays and Surveys in Global Optimization","author":"R. Horst","year":"2005","unstructured":"Horst, R., Van Thoai, N.: Duality bound methods in global optimization. In: Audet, C., Hansen, P., Savard, G. (eds.) Essays and Surveys in Global Optimization, pp. 79\u2013105. Springer, Berlin (2005)"},{"key":"7_CR52","unstructured":"ILOG: ILOG CPLEX 11.0 User\u2019s Manual. ILOG S.A., Gentilly, France (2008)"},{"issue":"1","key":"7_CR53","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00939332","volume":"57","author":"J. Judice","year":"1988","unstructured":"Judice, J., Mitra, G.: Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods. Journal of Optimization Theory and Applications\u00a057(1), 123\u2013149 (1988)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"7_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-006-0081-5","volume":"114","author":"V. Kaibel","year":"2008","unstructured":"Kaibel, V., Pfetsch, M.: Packing and partitioning orbitopes. Mathematical Programming\u00a0114(1), 1\u201336 (2008)","journal-title":"Mathematical Programming"},{"key":"7_CR55","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1006\/jsco.2000.0370","volume":"29","author":"E. Kaltofen","year":"2000","unstructured":"Kaltofen, E.: Challenges of symbolic computation: My favorite open problems. Journal of Symbolic Computation\u00a029, 891\u2013919 (2000), citeseer.nj.nec.com\/article\/kaltofen99challenge.html","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"7_CR56","first-page":"703","volume":"VIII","author":"J. Kelley","year":"1960","unstructured":"Kelley, J.: The cutting plane method for solving convex programs. Journal of SIAM\u00a0VIII(6), 703\u2013712 (1960)","journal-title":"Journal of SIAM"},{"issue":"3","key":"7_CR57","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10107-004-0503-1","volume":"100","author":"P. Kesavan","year":"2004","unstructured":"Kesavan, P., Allgor, R., Gatzke, E., Barton, P.: Outer-approximation algorithms for nonconvex mixed-integer nonlinear programs. Mathematical Programming\u00a0100(3), 517\u2013535 (2004)","journal-title":"Mathematical Programming"},{"key":"7_CR58","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01586054","volume":"54","author":"M. Kojima","year":"1992","unstructured":"Kojima, M., Megiddo, N., Ye, Y.: An interior point potential reduction algorithm for the linear complementarity problem. Mathematical Programming\u00a054, 267\u2013279 (1992)","journal-title":"Mathematical Programming"},{"key":"7_CR59","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno, H.: A cutting plane algorithm for solving bilinear programs. Mathematical Programming\u00a011, 14\u201327 (1976)","journal-title":"Mathematical Programming"},{"issue":"14","key":"7_CR60","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"},{"issue":"3","key":"7_CR61","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10589-005-4615-1","volume":"30","author":"S. Kucherenko","year":"2004","unstructured":"Kucherenko, S., Sytsko, Y.: Application of deterministic low-discrepancy sequences in global optimization. Computational Optimization and Applications\u00a030(3), 297\u2013318 (2004)","journal-title":"Computational Optimization and Applications"},{"key":"7_CR62","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/0-387-30927-6_9","volume-title":"Global Optimization: Scientific and Engineering Case Studies","author":"C. Lavor","year":"2006","unstructured":"Lavor, C., Liberti, L., Maculan, N.: Computational experience with the molecular distance geometry problem. In: Pint\u00e9r, J. (ed.) Global Optimization: Scientific and Engineering Case Studies, pp. 213\u2013225. Springer, Berlin (2006)"},{"key":"7_CR63","doi-asserted-by":"crossref","unstructured":"Lavor, C., Liberti, L., Maculan, N., Chaer Nascimento, M.: Solving Hartree-Fock systems with global optimization metohds. Europhysics Letters\u00a05(77), 50,006p1\u201350,006p5 (2007)","DOI":"10.1209\/0295-5075\/77\/50006"},{"key":"7_CR64","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A. Letchford","year":"2002","unstructured":"Letchford, A., Lodi, A.: Strengthening Chv\u00e1tal-Gomory cuts and Gomory fractional cuts. Operations Research Letters\u00a030, 74\u201382 (2002)","journal-title":"Operations Research Letters"},{"key":"7_CR65","unstructured":"Liberti, L.: Framework for symbolic computation in C++ using n-ary trees. Tech. rep., CPSE, Imperial College London (2001)"},{"key":"7_CR66","volume-title":"Optimization and Optimal Control","author":"L. Liberti","year":"2003","unstructured":"Liberti, L.: Comparison of convex relaxations for monomials of odd degree. In: Tseveendorj, I., Pardalos, P., Enkhbat, R. (eds.) Optimization and Optimal Control. World Scientific, Singapore (2003)"},{"issue":"1","key":"7_CR67","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1111\/j.1475-3995.2004.00438.x","volume":"11","author":"L. Liberti","year":"2004","unstructured":"Liberti, L.: Reduction constraints for the global optimization of NLPs. International Transactions in Operational Research\u00a011(1), 34\u201341 (2004)","journal-title":"International Transactions in Operational Research"},{"key":"7_CR68","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10288-004-0038-6","volume":"2","author":"L. Liberti","year":"2004","unstructured":"Liberti, L.: Reformulation and convex relaxation techniques for global optimization. 4OR\u00a02, 255\u2013258 (2004)","journal-title":"4OR"},{"key":"7_CR69","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulation and convex relaxation techniques for global optimization. Ph.D. thesis, Imperial College London, UK (2004)","DOI":"10.1007\/s10288-004-0038-6"},{"issue":"2","key":"7_CR70","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10898-004-0864-2","volume":"33","author":"L. Liberti","year":"2005","unstructured":"Liberti, L.: Linearity embedded in nonconvex programs. Journal of Global Optimization\u00a033(2), 157\u2013196 (2005)","journal-title":"Journal of Global Optimization"},{"key":"7_CR71","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Writing global optimization software. In: Liberti and Maculan [79], pp. 211\u2013262","DOI":"10.1007\/0-387-30528-9_8"},{"issue":"3","key":"7_CR72","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10288-006-0015-3","volume":"5","author":"L. Liberti","year":"2007","unstructured":"Liberti, L.: Compact linearization of binary quadratic problems. 4OR\u00a05(3), 231\u2013245 (2007)","journal-title":"4OR"},{"key":"7_CR73","first-page":"66","volume-title":"Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization","author":"L. Liberti","year":"2008","unstructured":"Liberti, L.: Reformulations in mathematical programming: Definitions. In: Aringhieri, R., Cordone, R., Righini, G. (eds.) Proceedings of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 66\u201370. Universit\u00e0 Statale di Milano, Crema (2008)"},{"key":"7_CR74","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":"7_CR75","doi-asserted-by":"crossref","unstructured":"Liberti, L.: Reformulations in mathematical programming: Definitions and systematics. RAIRO-RO (accepted for publication)","DOI":"10.1051\/ro\/2009005"},{"key":"7_CR76","unstructured":"Liberti, L., Dra\u017eic, M.: Variable neighbourhood search for the global optimization of constrained NLPs. In: Proceedings of GO Workshop, Almeria, Spain (2005)"},{"key":"7_CR77","unstructured":"Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proc. \u00a0of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)"},{"key":"7_CR78","doi-asserted-by":"crossref","unstructured":"Liberti, L., Lavor, C., Nascimento, M.C., Maculan, N.: Reformulation in mathematical programming: an application to quantum chemistry. Discrete Applied Mathematics (accepted for publication)","DOI":"10.1016\/j.dam.2007.08.044"},{"volume-title":"Global Optimization: from Theory to Implementation","year":"2006","key":"7_CR79","unstructured":"Liberti, L., Maculan, N. (eds.): Global Optimization: from Theory to Implementation. Springer, Berlin (2006)"},{"key":"7_CR80","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L. Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.: Convex envelopes of monomials of odd degree. Journal of Global Optimization\u00a025, 157\u2013168 (2003)","journal-title":"Journal of Global Optimization"},{"key":"7_CR81","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L. Liberti","year":"2006","unstructured":"Liberti, L., Pantelides, C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. Journal of Global Optimization\u00a036, 161\u2013189 (2006)","journal-title":"Journal of Global Optimization"},{"key":"7_CR82","unstructured":"Liberti, L., Tsiakis, P., Keeping, B., Pantelides, C.: $oo\\mathcal{OPS}$ . Centre for Process Systems Engineering, Chemical Engineering Department, Imperial College, London, UK (2001)"},{"issue":"1","key":"7_CR83","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":"7_CR84","unstructured":"Maculan, N., Macambira, E., de Souza, C.: Geometrical cuts for 0-1 integer programming. Tech. Rep. IC-02-006, Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (2002)"},{"key":"7_CR85","unstructured":"Makhorin, A.: GNU Linear Programming Kit. Free Software Foundation (2003), http:\/\/www.gnu.org\/software\/glpk\/"},{"key":"7_CR86","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01580671","volume":"10","author":"O. Mangasarian","year":"1976","unstructured":"Mangasarian, O.: Linear complementarity problems solvable by a single linear program. Mathematical Programming\u00a010, 263\u2013270 (1976)","journal-title":"Mathematical Programming"},{"key":"7_CR87","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01096765","volume":"6","author":"O. Mangasarian","year":"1995","unstructured":"Mangasarian, O.: The linear complementarity problem as a separable bilinear program. Journal of Global Optimization\u00a06, 153\u2013161 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"7_CR88","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01097059","volume":"7","author":"C.D. Maranas","year":"1995","unstructured":"Maranas, C.D., Floudas, C.A.: Finding all solutions to nonlinearly constrained systems of equations. Journal of Global Optimization\u00a07(2), 143\u2013182 (1995)","journal-title":"Journal of Global Optimization"},{"key":"7_CR89","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-002-0358-2","volume":"94","author":"F. Margot","year":"2002","unstructured":"Margot, F.: Pruning by isomorphism in branch-and-cut. Mathematical Programming\u00a094, 71\u201390 (2002)","journal-title":"Mathematical Programming"},{"key":"7_CR90","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-003-0394-6","volume":"98","author":"F. Margot","year":"2003","unstructured":"Margot, F.: Exploiting orbits in symmetric ILP. Mathematical Programming B\u00a098, 3\u201321 (2003)","journal-title":"Mathematical Programming B"},{"key":"7_CR91","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580665","volume":"10","author":"G. McCormick","year":"1976","unstructured":"McCormick, G.: Computability of global solutions to factorable nonconvex programs: Part I \u2014 Convex underestimating problems. Mathematical Programming\u00a010, 146\u2013175 (1976)","journal-title":"Mathematical Programming"},{"key":"7_CR92","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/B:JOGO.0000042112.72379.e6","volume":"29","author":"C. Meyer","year":"2004","unstructured":"Meyer, C., Floudas, C.: Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes. Journal of Global Optimization\u00a029, 125\u2013155 (2004)","journal-title":"Journal of Global Optimization"},{"issue":"9","key":"7_CR93","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1016\/j.cor.2004.03.010","volume":"32","author":"N. Mladenovi\u0107","year":"2005","unstructured":"Mladenovi\u0107, N., Plastria, F., Uro\u0161evi\u0107, D.: Reformulation descent applied to circle packing problems. Computers and Operations Research\u00a032(9), 2419\u20132434 (2005)","journal-title":"Computers and Operations Research"},{"key":"7_CR94","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"7_CR95","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming","author":"I. Nowak","year":"2005","unstructured":"Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkh\u00e4user, Basel (2005)"},{"key":"7_CR96","unstructured":"Pantelides, C., Liberti, L., Tsiakis, P., Crombie, T.: Mixed integer linear\/nonlinear programming interface specification. Global Cape-Open Deliverable WP2.3-04 (2002)"},{"volume-title":"Handbook of Global Optimization","year":"2002","key":"7_CR97","unstructured":"Pardalos, P., Romeijn, H. (eds.): Handbook of Global Optimization, vol.\u00a02. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"7_CR98","unstructured":"Plateau, M.C.: Reformulations quadratiques convexes pour la programmation quadratique en variables 0-1. Ph.D. thesis, Conservatoire National d\u2019Arts et M\u00e9tiers (2006)"},{"key":"7_CR99","unstructured":"Puchinger, J., Raidl, G.: Relaxation guided variable neighbourhood search. In: Proc.\u00a0of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)"},{"issue":"4","key":"7_CR100","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1287\/opre.17.4.680","volume":"17","author":"M. Raghavachari","year":"1969","unstructured":"Raghavachari, M.: On connections between zero-one integer programming and concave programming under linear constraints. Operations Research\u00a017(4), 680\u2013684 (1969)","journal-title":"Operations Research"},{"issue":"1","key":"7_CR101","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T. Roy van","year":"1987","unstructured":"van Roy, T., Wolsey, L.: Solving mixed integer programming problems using automatic reformulation. Operations Research\u00a035(1), 45\u201357 (1987)","journal-title":"Operations Research"},{"issue":"5","key":"7_CR102","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-8","volume":"19","author":"H. Ryoo","year":"1995","unstructured":"Ryoo, H., Sahinidis, N.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Computers & Chemical Engineering\u00a019(5), 551\u2013566 (1995)","journal-title":"Computers & Chemical Engineering"},{"key":"7_CR103","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1008249414776","volume":"12","author":"H. Sherali","year":"1998","unstructured":"Sherali, H.: Global optimization of nonconvex polynomial programming problems having rational exponents. Journal of Global Optimization\u00a012, 267\u2013283 (1998)","journal-title":"Journal of Global Optimization"},{"key":"7_CR104","doi-asserted-by":"crossref","unstructured":"Sherali, H.: Tight relaxations for nonconvex optimization problems using the reformulation-linearization\/convexification technique (RLT). In: Pardalos and Romeijn [97], pp. 1\u201363","DOI":"10.1007\/978-1-4757-5362-2_1"},{"key":"7_CR105","unstructured":"Sherali, H.: Personal communication (2007)"},{"key":"7_CR106","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"Sherali, H., Adams, W.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics\u00a03, 411\u2013430 (1990)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"7_CR107","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4388-3","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H. Sherali","year":"1999","unstructured":"Sherali, H., Adams, W.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publishers, Dodrecht (1999)"},{"key":"7_CR108","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H. Sherali","year":"1992","unstructured":"Sherali, H., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. Journal of Global Optimization\u00a02, 379\u2013410 (1992)","journal-title":"Journal of Global Optimization"},{"key":"7_CR109","doi-asserted-by":"crossref","first-page":"3263","DOI":"10.1007\/978-0-387-74759-0_559","volume-title":"Encyclopedia of Optimization","author":"H. Sherali","year":"2008","unstructured":"Sherali, H., Liberti, L.: Reformulation-linearization technique for global optimization. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 3263\u20133268. Springer, New York (2008)","edition":"2"},{"key":"7_CR110","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"H. Sherali","year":"1997","unstructured":"Sherali, H., Tuncbilek, C.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Operations Research Letters\u00a021, 1\u20139 (1997)","journal-title":"Operations Research Letters"},{"key":"7_CR111","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H. Sherali","year":"2001","unstructured":"Sherali, H., Wang, H.: Global optimization of nonconvex factorable programming problems. Mathematical Programming\u00a089, 459\u2013478 (2001)","journal-title":"Mathematical Programming"},{"key":"7_CR112","unstructured":"Smith, E.: On the optimal design of continuous processes. Ph.D. thesis, Imperial College of Science, Technology and Medicine, University of London (1996)"},{"key":"7_CR113","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/S0098-1354(97)87599-0","volume":"21","author":"E. Smith","year":"1997","unstructured":"Smith, E., Pantelides, C.: Global optimisation of nonconvex MINLPs. Computers & Chemical Engineering\u00a021, S791\u2013S796 (1997)","journal-title":"Computers & Chemical Engineering"},{"key":"7_CR114","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":"7_CR115","unstructured":"Strekalovsky, A.: On global optimality conditions for d.c. programming problems. Technical Paper, Irkutsk State University (1997)"},{"issue":"12","key":"7_CR116","first-page":"1742","volume":"41","author":"A. Strekalovsky","year":"2001","unstructured":"Strekalovsky, A.: Extremal problems with d.c. constraints. Computational Mathematics and Mathematical Physics\u00a041(12), 1742\u20131751 (2001)","journal-title":"Computational Mathematics and Mathematical Physics"},{"key":"7_CR117","volume-title":"The C++ Programming Language","author":"B. Stroustrup","year":"1999","unstructured":"Stroustrup, B.: The C++ Programming Language, 3rd edn. Addison-Wesley, Reading (1999)","edition":"3"},{"issue":"3","key":"7_CR118","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1023\/A:1016083231326","volume":"114","author":"A. Sutou","year":"2002","unstructured":"Sutou, A., Dai, Y.: Global optimization approach to unequal sphere packing problems in 3d. Journal of Optimization Theory and Applications\u00a0114(3), 671\u2013694 (2002)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"7_CR119","doi-asserted-by":"crossref","unstructured":"Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Tech. rep., Facolt\u00e0 di Economia e Commercio, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (2007)","DOI":"10.1007\/s11590-007-0065-2"},{"key":"7_CR120","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1021279918708","volume":"24","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Ahmed, S., Sahinidis, N.: Global optimization of 0-1 hyperbolic programs. Journal of Global Optimization\u00a024, 385\u2013416 (2002)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"7_CR121","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1011233805045","volume":"20","author":"M. Tawarmalani","year":"2001","unstructured":"Tawarmalani, M., Sahinidis, N.: Semidefinite relaxations of fractional programming via novel techniques for constructing convex envelopes of nonlinear functions. Journal of Global Optimization\u00a020(2), 137\u2013158 (2001)","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"7_CR122","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M. Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.: Convex extensions and envelopes of semi-continuous functions. Mathematical Programming\u00a093(2), 247\u2013263 (2002)","journal-title":"Mathematical Programming"},{"key":"7_CR123","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.: Exact algorithms for global optimization of mixed-integer nonlinear programs. In: Pardalos and Romeijn [97], pp. 65\u201386","DOI":"10.1007\/978-1-4757-5362-2_2"},{"key":"7_CR124","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.: Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming\u00a099, 563\u2013591 (2004)","journal-title":"Mathematical Programming"},{"key":"7_CR125","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1017\/S0962492901000071","volume":"10","author":"M. Todd","year":"2001","unstructured":"Todd, M.: Semidefinite optimization. Acta Numerica\u00a010, 515\u2013560 (2001)","journal-title":"Acta Numerica"},{"key":"7_CR126","unstructured":"Tsiakis, P., Keeping, B.: $oo\\mathcal{MILP}$ \u2013 a C++ callable object-oriented library and the implementation of its parallel version using corba. In: Liberti and Maculan [79], pp. 155\u2013210"},{"key":"7_CR127","unstructured":"Tsiakis, P., Keeping, B., Pantelides, C.: $oo\\mathcal{MILP}$ . Centre for Process Systems Engineering, Chemical Engineering Department, Imperial College, London, UK, 0.7 edn (2000)"},{"key":"7_CR128","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Mathematics, 1437\u20131440 (1964)"},{"key":"7_CR129","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-1-4615-2025-2_4","volume-title":"Handbook of Global Optimization","author":"H. Tuy","year":"1995","unstructured":"Tuy, H.: D.c. optimization: Theory, methods and algorithms. In: Horst, R., Pardalos, P. (eds.) Handbook of Global Optimization, vol.\u00a01, pp. 149\u2013216. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"7_CR130","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1008229430888","volume":"12","author":"X. Wang","year":"1998","unstructured":"Wang, X., Change, T.: A multivariate global optimization using linear bounding functions. Journal of Global Optimization\u00a012, 383\u2013404 (1998)","journal-title":"Journal of Global Optimization"},{"key":"7_CR131","doi-asserted-by":"crossref","unstructured":"Westerlund, T.: Some transformation techniques in global optimization. In: Liberti and Maculan [79], pp. 45\u201374","DOI":"10.1007\/0-387-30528-9_3"},{"issue":"3","key":"7_CR132","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0098-1354(97)00000-8","volume":"22","author":"T. Westerlund","year":"1998","unstructured":"Westerlund, T., Skrifvars, H., Harjunkoski, I., P\u00f6rn, R.: An extended cutting plane method for a class of non-convex MINLP problems. Computers & Chemical Engineering\u00a022(3), 357\u2013365 (1998)","journal-title":"Computers & Chemical Engineering"},{"key":"7_CR133","volume-title":"Integer Programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. Wiley, New York (1998)"},{"key":"7_CR134","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"J.M. Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. Journal of Global Optimization\u00a014, 217\u2013249 (1999)","journal-title":"Journal of Global Optimization"}],"container-title":["Studies in Computational Intelligence","Foundations of Computational Intelligence Volume 3"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01085-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T03:29:56Z","timestamp":1710300596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01085-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010842","9783642010859"],"references-count":134,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01085-9_7","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}