Computational results of an O∗(n4) volume algorithm
- 1 January 2012
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 216 (1) , 152-161
- https://doi.org/10.1016/j.ejor.2011.06.024
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The geometry of logconcave functions and sampling algorithmsRandom Structures & Algorithms, 2006
- Simulated Annealing for Convex OptimizationMathematics of Operations Research, 2006
- Simulated annealing in convex bodies and an volume algorithmJournal of Computer and System Sciences, 2006
- Hit-and-Run from a CornerSIAM Journal on Computing, 2006
- An open queueing network for lead time analysisIIE Transactions, 2002
- Hit-and-run mixes fastMathematical Programming, 1999
- Random walks and anO*(n5) volume algorithm for convex bodiesRandom Structures & Algorithms, 1997
- 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