NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

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.

PUBLICATIONS

Answers to the Homework Assignment in 'Monte Carlo Minimization and Counting'

Published

Author(s)

Isabel M. Beichl

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

Local Download

Keywords

algorithms, Monte Carlo, simulated annealing, travelling salesman problem

Citation

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 October 20, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created March 1, 2007, Updated February 17, 2017
Was this page helpful?