Abstract
The performance analysis of an approximation algorithm concentrates on the following two quantities:
-
the quality of the final solution obtained by the algorithm, i.e. the difference in cost value between the final solution and a globally minimal configuration;
-
the running time required by the algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
van Laarhoven, P.J.M., Aarts, E.H.L. (1987). Performance of the simulated annealing algorithm. In: Simulated Annealing: Theory and Applications. Mathematics and Its Applications, vol 37. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-7744-1_6
Download citation
DOI: https://doi.org/10.1007/978-94-015-7744-1_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-8438-5
Online ISBN: 978-94-015-7744-1
eBook Packages: Springer Book Archive