Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm
- 1 March 2004
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Computational results of an O∗(n4) volume algorithmEuropean Journal of Operational Research, 2012
- Random Vectors in the Isotropic PositionJournal of Functional Analysis, 1999
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- Isoperimetric problems for convex bodies and a localization lemmaDiscrete & Computational Geometry, 1995
- Random walks in a convex body and an improved volume algorithmRandom Structures & Algorithms, 1993
- On the randomized complexity of volume and diameterPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Computing the volume of convex bodies: a case where randomness provably helpsProceedings of Symposia in Applied Mathematics, 1991
- Sampling and integration of near log-concave functionsPublished by Association for Computing Machinery (ACM) ,1991
- Optimization by Simulated AnnealingScience, 1983