Efficiency of the random search method

Y.R. Rubinstein and G. Samorodnitsky

Mathematics and Computers in Simulation (MATCOM), 1982, vol. 24, issue 4, 257-268

Abstract: The efficiency of random search algorithms for both deterministic and stochastic optimization problems is considered.

Date: 1982
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0378475482900696
Full text for ScienceDirect subscribers only

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:eee:matcom:v:24:y:1982:i:4:p:257-268

DOI: 10.1016/0378-4754(82)90069-6

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().