Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
Publication:3532571
DOI10.1137/050644033zbMath1225.68270OpenAlexW2060222605WikidataQ56341081 ScholiaQ56341081MaRDI QIDQ3532571
Vijay V. Vazirani, Eric Vigoda, Ivona Bezáková, Daniel Štefanković
Publication date: 28 October 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050644033
Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Approximation methods and heuristics in mathematical programming (90C59) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (17)
This page was built for publication: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems