On Monte Carlo Methods in Congestion Problems: I. Searching for an Optimum in Discrete Situations

E. S. Page
Additional contact information
E. S. Page: University of Newcastle upon Tyne, Newcastle upon Tyne, England

Operations Research, 1965, vol. 13, issue 2, 291-299

Abstract: The crude Monte Carlo method is inefficient when searching for extreme points since it uses none of the information gained from earlier samples. If the possible situations are the permutations of a number of items, a method called Chain Monte Carlo is suggested that needs a measure of distance between two permutations. Examples are given and in some scheduling problems substantial savings in computation are observed.

Date: 1965
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.2.291 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:2:p:291-299

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().