{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:22:48Z","timestamp":1726413768994},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,7,27]],"date-time":"2014-07-27T00:00:00Z","timestamp":1406419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10100-014-0354-7","type":"journal-article","created":{"date-parts":[[2014,7,26]],"date-time":"2014-07-26T11:33:18Z","timestamp":1406374398000},"page":"925-952","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A parallel implementation of an $$O^*(n^4)$$ O \u2217 ( n 4 ) volume algorithm"],"prefix":"10.1007","volume":"23","author":[{"given":"L.","family":"Moh\u00e1csi","sequence":"first","affiliation":[]},{"given":"I.","family":"De\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,27]]},"reference":[{"key":"354_CR1","volume-title":"Parallel and distributed computation\u2014numerical methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas DP, Tsitsiklis JN (1989) Parallel and distributed computation\u2014numerical methods. Prentice Hall, Englewood Cliffs"},{"key":"354_CR2","first-page":"105","volume":"8","author":"I De\u00e1k","year":"1979","unstructured":"De\u00e1k I (1979) Comparison of methods for generating uniformly distributed random points in and on a hyperspere. Problems of Control and Information Theory 8:105\u2013113","journal-title":"Problems of Control and Information Theory"},{"key":"354_CR3","volume-title":"Mathematical methods of operations research (series)","author":"I De\u00e1k","year":"1990","unstructured":"De\u00e1k I (1990) Random number generators and simulation. In: Pr\u00e9kopa A (ed) Mathematical methods of operations research (series). Akad\u00e9miai Kiad\u00f3 (Publishing House of the Hungarian Academy of Sciences), Budapest"},{"key":"354_CR4","first-page":"1","volume":"34","author":"I De\u00e1k","year":"2002","unstructured":"De\u00e1k I (2002) Probabilities of simple $$n$$ n -dimensional sets in case of normal distribution. IIE Trans (Operations Engineering) 34:1\u201318","journal-title":"IIE Trans (Operations Engineering)"},{"key":"354_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10100-010-0166-3","volume":"19","author":"I De\u00e1k","year":"2011","unstructured":"De\u00e1k I (2011) Efficiency of Monte Carlo computations in very high dimensional spaces. CEJOR 19:177\u2013189","journal-title":"CEJOR"},{"key":"354_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-uniform random variate generation","author":"L Devroye","year":"1986","unstructured":"Devroye L (1986) Non-uniform random variate generation. Springer, New York"},{"key":"354_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102782.102783","volume":"38","author":"M Dyer","year":"1991","unstructured":"Dyer M, Frieze A, Kannan R (1991) A random polynomial-time algorithm for approximating the volume of convex bodies. J Assoc Comput Mach 38:1\u201317","journal-title":"J Assoc Comput Mach"},{"unstructured":"F\u00e1bi\u00e1n CI (2013) Computational aspects of risk-averse optimization in two-stage stochastic models. Stoch Program. E-Print Series 3-2013","key":"354_CR8"},{"key":"354_CR9","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1198\/106186002385","volume":"11","author":"H Gassmann","year":"2002","unstructured":"Gassmann H, De\u00e1k I, Sz\u00e1ntai T (2002) Computing multivariate normal probabilities: a new look. J Comput Graph Stat 11:920\u2013949","journal-title":"J Comput Graph Stat"},{"key":"354_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-5819-7","volume-title":"Monte Carlo methods","author":"JM Hammersley","year":"1964","unstructured":"Hammersley JM, Handscomb DC (1964) Monte Carlo methods. Methuen, London"},{"key":"354_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199708)11:1<1::AID-RSA1>3.0.CO;2-X","volume":"11","author":"R Kannan","year":"1997","unstructured":"Kannan R, Lov\u00e1sz L, Simonovits M (1997) Random walks and an $$O^*(n^5)$$ O \u2217 ( n 5 ) volume algorithm for convex bodies. Random Struct Algorithms 11:1\u201350","journal-title":"Random Struct Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L, Simonovits M (1992) On the randomized complexity of volume and diameter. In: Proceedings of 33rd IEEE annual symposium on foundations of Computer Science, pp 482\u2013491","key":"354_CR12","DOI":"10.1109\/SFCS.1992.267803"},{"key":"354_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/rsa.3240040402","volume":"4","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L, Simonovits M (1993) Random walks in a convex body and an improved volume algorithm. Random Struct Algorithms 4:359\u2013412","journal-title":"Random Struct Algorithms"},{"unstructured":"Lov\u00e1sz L, Vempala S (2003) Simulated annealing in convex bodies and an $$O^*(n^4)$$ O \u2217 ( n 4 ) volume algorithm. In: Proceedings of FOCS. pp 650\u2013659","key":"354_CR14"},{"doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L, Vempala S (2006) Simulated annealing in convex bodies and an $$O^*(n^4)$$ O \u2217 ( n 4 ) volume algorithm. J Comput Syst Sci 72:392\u2013417","key":"354_CR15","DOI":"10.1016\/j.jcss.2005.08.004"},{"doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L, De\u00e1k I (2012) Computational results of an $$O^*(n^4)$$ O \u2217 ( n 4 ) volume algorithm. Eur J Oper Res 216: 152\u2013161","key":"354_CR16","DOI":"10.1016\/j.ejor.2011.06.024"},{"key":"354_CR17","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087\u20131092","journal-title":"J Chem Phys"},{"unstructured":"Moh\u00e1csi L (2013) On the application of recent techniques in computers, PhD dissertation. Corvinus University of Budapest","key":"354_CR18"},{"key":"354_CR19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01100688","volume":"5","author":"E Romeijn","year":"1994","unstructured":"Romeijn E, Smith RL (1994) Simulated annealing for constrained global optimization. J Glob Optim 5:101\u2013126","journal-title":"J Glob Optim"},{"key":"354_CR20","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1006\/jfan.1998.3384","volume":"164","author":"M Rudelson","year":"1999","unstructured":"Rudelson M (1999) Random vectors in the isotropic position. J Funct Anal 164:60\u201372","journal-title":"J Funct Anal"},{"key":"354_CR21","volume-title":"CUDA by example\u2014an introduction to general purpose GPU programming","author":"J Sanders","year":"2010","unstructured":"Sanders J, Kandort E (2010) CUDA by example\u2014an introduction to general purpose GPU programming. Addison Wesley, Reading"},{"key":"354_CR22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10107-003-0447-x","volume":"97","author":"M Simonovits","year":"2003","unstructured":"Simonovits M (2003) How to compute the volume in high dimensions. Math Program Ser B 97:337\u2013374","journal-title":"Math Program Ser B"},{"doi-asserted-by":"crossref","unstructured":"Smith RL (1996) The hit and run sampler: a globally reaching Markov chain sampler for generating arbitrary multivariate distribution. In: Proceedings of 28th conference on winter simulation, pp 260\u2013264","key":"354_CR23","DOI":"10.1145\/256562.256619"},{"key":"354_CR24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich V, F\u00e1bi\u00e1n CI, Ellison EFD, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Math Program Comput 4:211\u2013238","journal-title":"Math Program Comput"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0354-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0354-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0354-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:32Z","timestamp":1559123372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0354-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,27]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["354"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0354-7","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"type":"print","value":"1435-246X"},{"type":"electronic","value":"1613-9178"}],"subject":[],"published":{"date-parts":[[2014,7,27]]}}}