{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:32:50Z","timestamp":1743049970342,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":58,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_433","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"2513-2520","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Quadratic Integer Programming: Models and Applications"],"prefix":"10.1007","author":[{"given":"W. Art","family":"Chaovalitwongse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozheng","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"433_CR1_433","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.orl.2004.05.001","volume":"33","author":"WP Adams","year":"2005","unstructured":"Adams WP, Forrester RJ (2005) A\u00a0simple recipe for concise mixed\n0\u20111 linearizations. Oper Res Lett 33:55\u201361","journal-title":"Oper Res Lett"},{"key":"433_CR2_433","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"WP Adams","year":"2004","unstructured":"Adams WP, Forrester RJ, Glover FW (2004) Comparison and\nenhancement strategies for linearizing mixed 0\u20111 quadratic programs. Discret\nOptim 1:99\u2013120","journal-title":"Discret Optim"},{"key":"433_CR3_433","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"WP Adams","year":"1986","unstructured":"Adams WP, Sherali HD (1986) A\u00a0tight linearization and an algorithm\nfor zero-one quadratic programming problems. Manag Sci 32:1274\u20131290","journal-title":"Manag Sci"},{"issue":"2","key":"433_CR4_433","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/opre.38.2.217","volume":"38","author":"WP Adams","year":"1990","unstructured":"Adams WP, Sherali HD (1990) Linearization strategies for a\u00a0class\nof zero-one mixed integer programming problems. Oper Res 38(2):217\u2013226","journal-title":"Oper Res"},{"issue":"3","key":"433_CR5_433","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581249","volume":"59","author":"WP Adams","year":"1993","unstructured":"Adams WP, Sherali HD (1993) Mixed-integer bilinear programming\nproblems. Math Program 59(3):279\u2013305","journal-title":"Math Program"},{"doi-asserted-by":"crossref","unstructured":"Aharon B-T, Teboulle M (1996) Hidden convexity in some nonconvex\nquadratically constrained quadratic programming. Math Program 72:51-639","key":"433_CR6_433","DOI":"10.1007\/BF02592331"},{"key":"433_CR7_433","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0377-2217(92)90082-K","volume":"60","author":"FA Al-Khayyal","year":"1992","unstructured":"Al-Khayyal FA (1992) Generalized bilinear programming: Part\nI. Models, applications and linear programming relaxation. Eur J Oper Res 60:306\u2013314","journal-title":"Eur J Oper Res"},{"key":"433_CR8_433","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02098176","volume":"34","author":"FA Al-Khayyal","year":"1992","unstructured":"Al-Khayyal FA, Horst R, Pardalos PM (1992) Global optimization of\nconcave functions subject to separable quadratic constraints: An application\nto bilevel programming. Ann Oper Res 34:125\u2013147","journal-title":"Ann Oper Res"},{"key":"433_CR9_433","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"FA Al-Khayyal","year":"1995","unstructured":"Al-Khayyal FA, Larsen C, van Voorhis T (1995) A\u00a0relaxation method\nfor nonconvex quadratically constrained quadratic programs. J\u00a0Glob Optim\n6:215\u2013230","journal-title":"J Glob Optim"},{"key":"433_CR10_433","volume-title":"State of the art in global optimization: computational methods and applications","author":"FA Al-Khayyal","year":"1996","unstructured":"Al-Khayyal FA, van Voorhis T (1996) Accelerating convergence of\nbranch-and-bound algorithms for quadratically constrained optimization\nproblems. In: Floudas CA (ed) State of the art in global optimization:\ncomputational methods and applications. Kluwer, Dordrecht"},{"key":"433_CR11_433","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet C, Hansen P, Jaumard B, Savard G (2000) A\u00a0branch and cut\nalgorithms for nonconvex quadratically constrained program. Math Program 87:131\u2013152","journal-title":"Math Program"},{"key":"433_CR12_433","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800190204","volume":"19","author":"DP Baron","year":"1972","unstructured":"Baron DP (1972) Quadratic programming with quadratic\nconstraints. Nav Res Logist Q 19:253\u2013260","journal-title":"Nav Res Logist Q"},{"issue":"1","key":"433_CR13_433","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1002\/nav.3800270104","volume":"27","author":"MS Bazaraa","year":"1980","unstructured":"Bazaraa MS, Sherali HD (1980) Benders' partitioning applied to\na\u00a0new formulation of the quadratic assignment problem. Nav Res Logist Q 27(1):28\u201342","journal-title":"Nav Res Logist Q"},{"issue":"2","key":"433_CR14_433","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S1052623493259215","volume":"7","author":"A Ben-Tal","year":"1997","unstructured":"Ben-Tal A, Zibulevsky M (1997) Penalty\/Barrier multiplier methods\nfor convex programming problems. SIAM J Optim 7(2):347\u2013366","journal-title":"SIAM J Optim"},{"unstructured":"Ben-Saad S (1989) An algorithm for a\u00a0class of nonlinear convex\noptimization problems. PhD thesis. University of California, Los Angeles","key":"433_CR15_433"},{"issue":"6","key":"433_CR16_433","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"WA Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse WA, Pardalos PM, Prokoyev OA (2004) Reduction of\nMulti-Quadratic 0\u20111 Programming Problems to Linear Mixed 0\u20111 Programming\nProblems. Oper Res Lett 32(6):517\u2013522","journal-title":"Oper Res Lett"},{"key":"433_CR17_433","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1287\/opre.11.4.637","volume":"11","author":"DH Evans","year":"1963","unstructured":"Evans DH (1963) Modular design\u00a0\u2013 A\u00a0special case in nonlinear\nprogramming. Oper Res 11:637\u2013647","journal-title":"Oper Res"},{"key":"433_CR18_433","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1287\/opre.18.3.562","volume":"18","author":"DH Evans","year":"1970","unstructured":"Evans DH (1970) A\u00a0note on modular design\u00a0\u2013 A\u00a0special case in\nnonlinear programming. Oper Res 18:562\u2013564","journal-title":"Oper Res"},{"issue":"9","key":"433_CR19_433","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1287\/mnsc.15.9.550","volume":"15","author":"JE Falk","year":"1969","unstructured":"Falk JE, Soland RM (1969) An algorithm for separable nonvox\nprogramming problems. Manag Sci 15(9):550\u2013569","journal-title":"Manag Sci"},{"issue":"1","key":"433_CR20_433","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF00938818","volume":"53","author":"JA Filar","year":"1987","unstructured":"Filar JA, Schultz TA (1987) Bilinear programming and structured\nstochastic games. J\u00a0Optim Theor Appl 53(1):85\u2013104","journal-title":"J Optim Theor Appl"},{"key":"433_CR21_433","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-1-4615-2025-2_5","volume-title":"Handbook of Global Optimization","author":"CA Floudas","year":"1995","unstructured":"Floudas CA, Visweswaran V (1995) Quadratic optimization. In:\nHorst R, Pardalos PM (eds) Handbook of Global Optimization. Kluwer, Dordrecht, pp 217\u2013269"},{"key":"433_CR22_433","first-page":"5","volume":"1","author":"R Fortet","year":"1959","unstructured":"Fortet R (1959) L'alg\u00e8bre de Boole et ses Applications en\nRecherche Op\u00e9rationnelle. Cah Cent Etudes Rech Oper 1:5\u201336","journal-title":"Cah Cent Etudes Rech Oper"},{"key":"433_CR23_433","first-page":"17","volume":"4","author":"R Fortet","year":"1960","unstructured":"Fortet R (1960) Applications de l'alg\u00e8bre de Boole et Recherche\nOp\u00e9rationnelle. Rev Fr Informat Rech Oper 4:17\u201326","journal-title":"Rev Fr Informat Rech Oper"},{"key":"433_CR24_433","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F Glover","year":"1975","unstructured":"Glover F (1975) Improved linear integer programming formulation\nof nonlinear integer programs. Manag Sci 22:455\u2013460","journal-title":"Manag Sci"},{"issue":"1","key":"433_CR25_433","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F Glover","year":"1973","unstructured":"Glover F, Woolsey E (1973) Futher reduction of zero-one\npolynomial programs to zero-one linear programming. Oper Res 21(1):156\u2013161","journal-title":"Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Glover F, Woolsey E (1974) Converting the 0\u20111 Polynomial\nProgramming Program to a\u00a00\u20111 Linear Program. Oper Res 22(1):180\u2011182","key":"433_CR26_433","DOI":"10.1287\/opre.22.1.180"},{"key":"433_CR27_433","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 (1979) Methods of nonlinear 0\u20111 programming. Ann Discret\nMath 5:53\u201370","journal-title":"Ann Discret Math"},{"key":"433_CR28_433","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00121301","volume":"2","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B (1992) Reduction of indefinite quadratic\nprograms to bilinear programs. J\u00a0Glob Optim 2:41\u201360","journal-title":"J Glob Optim"},{"key":"433_CR29_433","volume-title":"Introduction to global optimization","author":"R Horst","year":"1995","unstructured":"Horst R, Pardalos PM, Thoai NV (1995) Introduction to global\noptimization. Kluwer, Dordrecht"},{"issue":"1","key":"433_CR30_433","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1080\/1055678021000054998","volume":"18","author":"LD Iasemidis","year":"2003","unstructured":"Iasemidis LD, Pardalos PM, Shiau D-S, Chaovalitwongse WA,\nNarayanan K, Kumar S, Carney PR, Sackellares JC (2003) Prediction of Human\nEpileptic Seizures based on Optimization and Phase Changes of Brain Electrical\nActivity. Optim Methods Softw 18(1):81\u2013104","journal-title":"Optim Methods Softw"},{"key":"433_CR31_433","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1525\/9780520411586-036","volume-title":"Proceedings of the Second Berkeley Symposium on Math. Stat. and Prob","author":"HW Kuhn","year":"1951","unstructured":"Kuhn HW, Tucker AW (1951) Nonlinear Programming. In: Nayman J\n(ed) Proceedings of the Second Berkeley Symposium on Math. Stat. and\nProb. University of California Press, Berkeley, pp 481\u2013492"},{"issue":"2","key":"433_CR32_433","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth J (2005) A\u00a0simplicial branch-and-bound algorithm for\nsolving quadratically constrained quadratic programs. Math Program 103(2):251\u2013282","journal-title":"Math Program"},{"key":"433_CR33_433","volume-title":"SIAM Series in Applied Mathematics","author":"YE Nesterov","year":"1994","unstructured":"Nesterov YE, Nemirovskii AA (1994) Interior Point Polynomial\nMethods in Convex Programming. In: SIAM Series in Applied Mathematics. SIAM, Philadelphia"},{"issue":"2","key":"433_CR34_433","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"PM Pardalos","year":"2004","unstructured":"Pardalos PM, Chaovalitwongse WA, Iasemidis LD, Sackellares JC,\nShiau D-S, Carney PR, Prokopyev OA, Yatsenko VA (2004) Seizure Warning\nAlgorithm Based on Spatiotemporal Dynamics of Intracranial EEG. Math Program\n101(2):365\u2013385","journal-title":"Math Program"},{"key":"433_CR35_433","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02239972","volume":"39","author":"PM Pardalos","year":"1987","unstructured":"Pardalos PM, Glick JH, Rosen JB (1987) Global minimization of\nindefinite quadratic problems. Computing 39:281\u2013291","journal-title":"Computing"},{"issue":"1","key":"433_CR36_433","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1023\/A:1009877331765","volume":"5","author":"PM Pardalos","year":"2001","unstructured":"Pardalos PM, Iasemidis LD, Shiau D-S, Sackellares JC (2001)\nQuadratic binary programming and dynamic system approach to determine the\npredictability of epileptic seizures. J\u00a0Comb Optim 5(1):9\u201326","journal-title":"J Comb Optim"},{"issue":"6\/7","key":"433_CR37_433","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0898-1221(91)90165-Z","volume":"21","author":"PM Pardalos","year":"1991","unstructured":"Pardalos PM, Jha S (1991) Graph separation techniques for\nquadratic zero-one programming. Comput Math Appl 21(6\/7):107\u2013113","journal-title":"Comput Math Appl"},{"key":"433_CR38_433","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990) Computational aspects of a\u00a0branch\nand bound algorithm for quadratic 0\u20111 programming. Computing 45:131\u2013144","journal-title":"Computing"},{"key":"433_CR39_433","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF02023057","volume":"22","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990) Parallel branch and bound\nalgorithm for quadratic zero-one on a\u00a0hypercube architecture. Ann Oper Res\n22:271\u2013292","journal-title":"Ann Oper Res"},{"issue":"3","key":"433_CR40_433","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"PM Pardalos","year":"1986","unstructured":"Pardalos PM, Rosen JB (1986) Methods for global concave\nminimization: A\u00a0bibliographic survey. SIAM Rev 28(3):367\u2013379","journal-title":"SIAM Rev"},{"unstructured":"Petersen CC (1971) A\u00a0note on transforming the product of\nvariables to linear form in linear programs. Working Paper, Purdue University","key":"433_CR41_433"},{"doi-asserted-by":"crossref","unstructured":"Phan Huy Hao E (1982) Quadratically constrained quadratic\nprogramming: Some applications and a\u00a0method for solution. Z Oper Res\n26:105\u2013119","key":"433_CR42_433","DOI":"10.1007\/BF01917102"},{"doi-asserted-by":"crossref","unstructured":"Phing TQ, Tao PD, Hoai An LT (1994) A\u00a0method for solving\nD.C. programming problems, application to fuel mixture nonconvex optimization\nproblems. J\u00a0Glob Optim 6:87\u2013105","key":"433_CR43_433","DOI":"10.1007\/BF01106607"},{"key":"433_CR44_433","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U Raber","year":"1998","unstructured":"Raber U (1998) A\u00a0simplicial branch-and-bound method for solving\nnonconvex all-quadratic programs. J\u00a0Glob Optim 13:417\u2013432","journal-title":"J Glob Optim"},{"key":"433_CR45_433","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"JMW Rhys","year":"1970","unstructured":"Rhys JMW (1970) A\u00a0selection problem of shared fixed costs and\nnetwork flows. Manag Sci 17:200\u2013207","journal-title":"Manag Sci"},{"issue":"4","key":"433_CR46_433","doi-asserted-by":"publisher","first-page":"B220","DOI":"10.1287\/mnsc.18.4.B220","volume":"18","author":"DP Rutenberg","year":"1971","unstructured":"Rutenberg DP, Shaftel TL (1971) Product design: Subassemblies for\nmultiple markets. Manag Sci 18(4):B220\u2013B231","journal-title":"Manag Sci"},{"key":"433_CR47_433","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-006-0107-7","volume":"147","author":"HD Sherali","year":"2007","unstructured":"Sherali HD (2007) RLT: A\u00a0unified approach for discrete and\ncontinuous nonconvex optimization. Ann Oper Res 147:185\u2013193","journal-title":"Ann Oper Res"},{"issue":"4","key":"433_CR48_433","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1287\/opre.32.4.878","volume":"32","author":"HD Sherali","year":"1984","unstructured":"Sherali HD, Adams WP (1984) A\u00a0decomposition algorithm for\na\u00a0discrete location-allocation problem. Oper Res 32(4):878\u2013900","journal-title":"Oper Res"},{"issue":"3","key":"433_CR49_433","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali HD, Adams WP (1990) A\u00a0hierarchy of relaxations between\nthe continuous and convex hull representations for zero-one programming\nproblems. SIAM J Discret Math 3(3):411\u2013430","journal-title":"SIAM J Discret Math"},{"key":"433_CR50_433","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"HD Sherali","year":"1994","unstructured":"Sherali HD, Adams WP (1994) A\u00a0hierarchy of relaxations and\nconvex hull Characterizations for mixed-integer zero-one programming\nproblems. Discret Appl Math 52:83\u2013106","journal-title":"Discret Appl Math"},{"key":"433_CR51_433","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":"HD Sherali","year":"1999","unstructured":"Sherali HD, Adams WP (1999) A\u00a0Reformulation-Linearization\nTechnique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht"},{"issue":"3","key":"433_CR52_433","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1287\/opre.46.3.396","volume":"46","author":"HD Sherali","year":"1998","unstructured":"Sherali HD, Adams WP, Driscoll PJ (1998) Exploiting special\nstructures in constructing a\u00a0hierarchy of relaxations for 0\u20111 mixed integer\nproblems. Oper Res 46(3):396\u2013405","journal-title":"Oper Res"},{"issue":"11","key":"433_CR53_433","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1287\/mnsc.17.11.759","volume":"17","author":"RM Soland","year":"1971","unstructured":"Soland RM (1971) An algorithm for separable nonvox programming\nproblems II: Nonconvex constraints. Manag Sci 17(11):159","journal-title":"Manag Sci"},{"key":"433_CR54_433","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1137\/0805016","volume":"5","author":"RJ Stern","year":"1995","unstructured":"Stern RJ, Wolkowicz H (1995) Indefinite trust region subproblems\nand nonsymmetric eigenvalue perturbations. SIAM J Optim 5:286\u2013313","journal-title":"SIAM J Optim"},{"key":"433_CR55_433","first-page":"69","volume":"4","author":"K Swarup","year":"1966","unstructured":"Swarup K (1966) Indefinite quadratic programming with a\u00a0quadratic\nconstraint. Ekonom Obz 4:69\u201375","journal-title":"Ekonom Obz"},{"key":"433_CR56_433","first-page":"709","volume":"12","author":"C Van De Panne","year":"1966","unstructured":"Van De Panne C (1966) Programming with a\u00a0quadratic\nconstraint. Manag Sci 12:709\u2013815","journal-title":"Manag Sci"},{"key":"433_CR57_433","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"LJ Watters","year":"1967","unstructured":"Watters LJ (1967) Reduction of integer polynomial programming to\nzero-one linear programming problems. Oper Res 15:1171\u2013117","journal-title":"Oper Res"},{"issue":"3","key":"433_CR58_433","first-page":"30","volume":"5","author":"WI Zangwill","year":"1965","unstructured":"Zangwill WI (1965) Media selection by decision programming. J\u00a0Advert Res 5(3):30\u201336","journal-title":"J Advert Res"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:51:47Z","timestamp":1720691507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_433","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}