Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

@article{Bezkov2006AcceleratingSA,
  title={Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems},
  author={Ivona Bez{\'a}kov{\'a} and Daniel Stefankovic and Vijay V. Vazirani and Eric Vigoda},
  journal={SIAM J. Comput.},
  year={2006},
  volume={37},
  pages={1429-1454}
}
We present an improved "cooling schedule" for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature decreases. Thus, fewer intermediate temperatures are needed as the simulated annealing algorithm moves from the high temperature (easy region) to the low temperature (difficult region). We present applications of our technique to colorings and the permanent (perfect matchings of bipartite graphs). Moreover… CONTINUE READING
Highly Cited
This paper has 80 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

80 Citations

051015'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…