Runtime distributions

Mauricio G. C. Resende and Celso C. Ribeiro
Additional contact information
Mauricio G. C. Resende: Amazon.com, Inc., Modeling and Optimization Group (MOP)
Celso C. Ribeiro: Universidade Federal Fluminense, Instituto de Ciência da Computação

Chapter Chapter 6 in Optimization by GRASP, 2016, pp 113-146 from Springer

Abstract: Abstract Runtime distributions or time-to-target plots display on the ordinate axis the probability that an algorithm will find a solution at least as good as a given target value within a given running time, shown on the abscissa axis. They provide a very useful tool to characterize the running times of stochastic algorithms for combinatorial optimization problems and to compare different algorithms or strategies for solving a given problem. They have been widely used as a tool for algorithm design and comparison.

Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-1-4939-6530-4_6

Ordering information: This item can be ordered from
http://www.springer.com/9781493965304

DOI: 10.1007/978-1-4939-6530-4_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().