Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
RAIRO-Oper. Res., 20 3 (1986) 177-197
Published online: 2017-02-06
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Dynamical Systems, Plasmas and Gravitation
Jean-Luc Lutton and Nicolas PreuxLecture Notes in Physics, Dynamical Systems, Plasmas and Gravitation 518 348 (1999)
https://doi.org/10.1007/BFb0105941
Metaheuristics: A bibliography
Ibrahim H. Osman and Gilbert LaporteAnnals of Operations Research 63 (5) 511 (1996)
https://doi.org/10.1007/BF02125421
A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm
David Abramson, Henry Dang and Mohan KrishnamoorthyAnnals of Operations Research 63 (1) 129 (1996)
https://doi.org/10.1007/BF02601642
Applied Simulated Annealing
Pierre Chardaire and Jean Luc LuttonLecture Notes in Economics and Mathematical Systems, Applied Simulated Annealing 396 175 (1993)
https://doi.org/10.1007/978-3-642-46787-5_9
283 (1990)
https://doi.org/10.1109/EDAC.1990.136660