Simulated annealing in convex bodies and an volume algorithm
- 1 March 2006
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 72 (2) , 392-417
- https://doi.org/10.1016/j.jcss.2005.08.004
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Solving convex programs by random walksJournal of the ACM, 2004
- 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
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Computing the volume is difficultDiscrete & Computational Geometry, 1987
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Optimization by Simulated AnnealingScience, 1983
- Über eine Klasse superadditiver Mengenfunktionale von Brunn-Minkowski-Lusternikschem TypusMathematische Zeitschrift, 1957