Beichl, I.
(2007),
Answers to the Homework Assignment in 'Monte Carlo Minimization and Counting', Computing in Science & Engineering, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51106
(Accessed November 8, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Answers to the Homework Assignment in 'Monte Carlo Minimization and Counting'
Published
Author(s)
Abstract
This is an answer key to questions posed in our previous article in the "Your Homework Assignment" series. We discuss simulated annealing and annealing schedules for the travelling salesman problem.Citation
Computing in Science & Engineering
Volume
9
Issue
2
Pub Type
Journals
Download Paper
Keywords
algorithms, Monte Carlo, simulated annealing, travelling salesman problem
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created March 1, 2007, Updated February 17, 2017