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

Your Homework Assignment Monte Carlo Minimization and Counting: One, Two, ..., Too Many

Published

Author(s)

Isabel M. Beichl, Dianne M. O'Leary, Francis Sullivan

Abstract

This is a tutorial article on Monte Carlo methods for optimization. Topics covered include Lipschitz conditions, simulated annealing and combinatorial counting methods.
Citation
IEEE Computing in Science and Engineering
Volume
9
Issue
1
Pub Type
Journals

Download Paper

Local Download

Keywords

combinatorics, Monte Carlo, optimization

Citation

Beichl, I. , O'Leary, D. and Sullivan, F. (2007), Your Homework Assignment Monte Carlo Minimization and Counting: One, Two, ..., Too Many, IEEE Computing in Science and Engineering, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50919 (Accessed November 4, 2025)

Issues

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

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