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.
4.3 Bibliographical Notes
Dell’Amico, M., and M. Trubian [1993], Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41, 231–252.
Laarhoven, P.J.M. van [1988], Theoretical and Computational Aspects of Simulated Annealing, Ph.D. thesis, Eindhoven University of Technology, The Netherlands.
Laarhoven, P.J.M. van, E.H.L. Aarts, and J.K. Lenstra [1992], Job shop scheduling by simulated annealing, Operations Research 40, 113–125.
Matsuo, H., C.J. Suh, and R.S. Sullivan [1988], A controlled search simulated annealing method for the general job shop scheduling problem, Working paper 03-04-88, Graduate School of Business, University of Texas, Austin, TX.
Stadler, P.F., and W. Schnabl [1992], The landscape of the traveling salesman problem, Physics Letters A 161, 337–344.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Properties of Neighborhood Functions. In: Theoretical Aspects of Local Search. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-35854-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-35854-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35853-4
Online ISBN: 978-3-540-35854-1
eBook Packages: Computer ScienceComputer Science (R0)