The gibbs cloner for combinatorial optimization, counting and sampling

Methodology and Computing in Applied Probability

Volumn 11, Issue 4, 2009, Pages 491-549

  Rubinstein, Reuven ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Combinatorial optimization; Counting; Cross entropy; Gibbs sampler; Importance sampling; Rare event

Indexed keywords

EID: 70350075401     PISSN: 13875841     EISSN: 15737713     Source Type: Journal    
DOI: 10.1007/s11009-008-9101-7     Document Type: Article

References (19)

1. Bezakova I, Stefankovic D, Vazirani V, Vigoda E (2007) Accelerating simulated annealing for the permanent and combinatorial counting problems. SIAM J Comput (to appear)
2. Botev ZI (2007) Three examples of a practical exact markov chain sampling. Manuscript, November
3. Botev ZI, Kroese DP (2008) An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting. Methodol Comput Appl Probab (to appear)
4. Del Moral P (2004) Feynman-Kac formulae genealogical and interacting particle systems. Springer
5. Diaconis P, Andersen H (2007) Hit and run as a unifying device. Manuscript
6. Diaconis P, Holmes S (1994) Three examples of the Markov chain Monte Carlo method. In: Aldous D, et al (eds) Discrete probability and algorithms. Springer, New York, pp 43-56
7. Ghate AR, Smith RL (2008) A dynamic programing approach to efficient sampling from boltzmann distribution. OR Lett (to appear)
8. Lui JS (2001) Monte Carlo strategies in scientific computing. Springer
9. Mitzenmacher M, Upfal E (2005) Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge Univ. Press, New York (NY)
10. Motwani R, Raghavan R (1997) Randomized algorithms. Cambridge University Press
11. Ross SM (2002a) Simulation, 3rd edn. Academic
12. Ross SM (2002b) Probability models for computer science. Academic
13. Rubinstein RY (2008a) Semi-iterative minimum cross-entropy algorithms for rare-events, counting, combinatorial and integer programing. Methodol Comput Appl Probab (2):1-45
14. Rubinstein RY (2008b) Entropy and cloning methods for combinatorial optimization, sampling and counting using the gibbs sampler. Information theory and statistical learning. Springer
15. Rubinstein RY, Kroese DP (2004) The cross-entropy method: A unified approach to combinatorial optimization, Monte-Carlo simulation and machine learning. Springer
16. Rubinstein RY, Kroese DP (2007) Simulation and the Monte Carlo method, 2nd edn. Wiley
17. Rubinstein RY, Kroese DP, Dolgin A, Glynn PW (2007) Parametric minimum cross-entropy method for counting the number of satisfiability assignments. Manuscript, Technion, Israel
18. Smith RL (1984) Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper Res 32:1296-1308
19. Stefankovic D, Vempala S, Vigoda E (2007) Adaptive simulated annealing: a near-optimal connection between sampling and counting. FOCS