Free Access
Issue
RAIRO-Oper. Res.
Volume 32, Number 1, 1998
Page(s) 43 - 73
DOI https://doi.org/10.1051/ro/1998320100431
Published online 10 February 2017
  • 1. E. H. L. AARTS, M. J. de BONT, E. H. A. HABERS and P. J. M. van LAARHOVEN, Parallel implementation of the statistical cooling algorithm, The VLSI Journal, June 1986, 4, pp.209-238. [Zbl: 0601.65051] [Google Scholar]
  • 2. E. H. L AARTS and P. J. M. van LAARHOVEN, Simulated Annealing and Applications: Mathematics and its Applications, D. Reidel Publishing Company, 1987. [Zbl: 0643.65028] [Google Scholar]
  • 3. J. AKAYAMA, G. EXOO and F. HARARY, Covering and packing in graph III: cyclic and acyclic invariant , Math. Slovaca, 1980, 30, pp. 405-417. [EuDML: 34095] [MR: 595302] [Zbl: 0458.05050] [Google Scholar]
  • 4. E. H. L. AARTS and J. KORST, Simulated Annealing and Boltzmann Machines, John Wiley & Sons Ltd., 1989. [MR: 983115] [Zbl: 0674.90059] [Google Scholar]
  • 5. R. AZENCOTT, Sequential Annealing: Acceleration by Monotone Concave Distortions of the Energy Function, section 1.5, pp. 6-7, In AZENCOTT [6], 1992. [MR: 1188931] [Google Scholar]
  • 6. R. AZENCOTT, editor, Simulated Annealing: Parallelization Techniques, John Wiley & Sons inc., 1992. [MR: 1188930] [Zbl: 0746.00020] [Google Scholar]
  • 7. O. CATONI, Etude Asymptotique des Algorithmes de Recuit Simulé, PhD thesis, Université d'Orsay, 1990. [Google Scholar]
  • 8. O. CATONI, Rates of Convergence for Sequential Annealing: a Large Deviation Approach, chapter 3, pp. 25-36, In Azencott [6], 1992. [MR: 1188933] [Zbl: 0776.90063] [Google Scholar]
  • 9. T. S. CHIANG and Y. CHOW, On the convergence rates of annealing processes, SIAM J. Control Optimization, 1988, 26, pp. 1455-1470. [MR: 969338] [Zbl: 0665.60090] [Google Scholar]
  • 10. D. DELAMARRE, J. L. FOUQUET, H. THUILLIER and B. VIROT, Linear-k-arboricity of cubic graphs. Research Report 93-8, Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans BP 6759 F45067 Orléans Cedex 2, 1993. [Google Scholar]
  • 11. D. DELAMARRE, Etude et Conception d'Algorithmes Parallèles d'Optimisation Combinatoire Discrète Approchée. Implantation sur Architectures MIMD, PhD thesis, Université d'Orléans, LIFO, 4, rue Léonard de Vinci, BP 6759 F45067 Orléans Cedex 2, France, Déc. 1994. [Google Scholar]
  • 12. D. DELAMARRE and B. VIROT, Simulated Annealing Applied to the Hamiltonian Problem for Cubic Graphs, Research Report 93-3, Laboratoire d'Informatique Fondamentale d'Orléans, Université d'Orléans, BP 6759 F45067 Orléans Cedex 2, France, 1993. [Google Scholar]
  • 13. R. DIEKMANN, R. LÜLLING and J. SIMON, A general purpose distributed implementation of simulated annealing. In IMACS'91 13th World Congress on Computation and Applied Mathematics, 1991, pp.816-817. [Google Scholar]
  • 14. M. D. DURAND, Trading Accuracy for Speed in Parallel Simulated Annealing Algorithms, PhD thesis, Columbia University, 1990. [Google Scholar]
  • 15. M. D. DURAND and S. R. WHITE, Permissible error in parallel simulated annealing, Technical report, Institut de Recherche en Informatique et Systèmes aléatoires, Rennes, France, July 1991. [Google Scholar]
  • 16. R.W. EGLESE, Simulated annealing: a tool for operational research, European Journal of Operational Research, 1990, 46, pp. 271-281. [MR: 1064622] [Zbl: 0699.90080] [Google Scholar]
  • 17. M. I. FRIEDLIN and A. D. WENTZEL, Random Perturbations of Dynamical Systems, Springer-Verlag, 1984. [Zbl: 0522.60055] [Google Scholar]
  • 18. M. R. GAREY and M. R. JOHNSON, Computer and Intractability, Freeman, 1979. [Zbl: 0411.68039] [Google Scholar]
  • 19. G. GRAFFIGNE, Parallel Annealing by Periodically Interacting Multiple Searches: an Experimental Study, chapter 5, pp. 47-79, In AZENCOTT [6], 1992. [Zbl: 0779.90069] [Google Scholar]
  • 20. D. R. GREENING, Parallel simulated annealing techniques, Physica, 1990, D, 42, pp. 293-306. [Google Scholar]
  • 21. D. R. GREENING, Simulated annealing with inacurrate costs functions, unpublished, October 1993. [Google Scholar]
  • 22. B. HAJEK, Cooling schedules for optimal annealing, MOR, 1988, 13, pp. 311-329. [MR: 942621] [Zbl: 0652.65050] [Google Scholar]
  • 23. B. HAJEK and G. H. SASAKI, The time complexity of maximum matching by simulated annealing, J. of the ACM, 1988, 35, pp. 387-403. [MR: 935258] [Zbl: 0825.68416] [Google Scholar]
  • 24. L. INGBER, Very fast simulated reannealing, Journal of Mathematical Computing Modelling, 1989, 12 (8), pp. 967-973. [MR: 1007028] [Zbl: 0681.90091] [Google Scholar]
  • 25. L. INGBER, Simulated annealing: Practice versus theory, Journal of Mathematical Computing Modelling, May 1993, 18 (11), pp. 23-57 [MR: 1254392] [Zbl: 0819.90080] [Google Scholar]
  • 26. K. KIMURA and K. TAKI, Time-homogeneous parallel annealing algorithm. In IMACS' 91 13th World Congress on Computation and Applied Mathematics, 1991, pp. 827-828. [Google Scholar]
  • 27. S. KIRKPATRICK, C. D. Jr GELATT and M. P. VECCHI, Optimization by simulated annealing, Science, May 1983, 220 (4598), pp. 671-680. [Zbl: 1225.90162] [MR: 702485] [Google Scholar]
  • 28. R. H. J. M. OTTEN, L. P. P. P. van GINNEKEN, The Annealing Algorithm, Kluwer Academic Publisher, 1989. [MR: 1199113] [Google Scholar]
  • 29. C. R. REEVES, Modern Heuristic Techniques for Combinatorial Problems, Colin R. Reeves, blackwell scientific publications editions, 1993, Osney Mead, Oxford OX2 OEL. [MR: 1230642] [Zbl: 0942.90500] [Google Scholar]
  • 30. P. POUSSEL-RAGOT and G. DREYFUS, Parallel Anealing by Multiple Trials: an Experimental study on a Transputer Network, chapter 7, pp. 91-108, In AZENCOTT [6], 1992. [Zbl: 0758.90062] [Google Scholar]
  • 31. B. VIROT, Parallel Annealing by Multiple Trials: Experimental study of a Chip Placement Problem Using a Sequent Machine, chapter 8, pp. 109-129, In Azencott [6], 1992. [Zbl: 0779.90071] [Google Scholar]
  • 32. E. E. WHITE, R. D. CHAMBERLAIN and M. A. FRANKLIN, Parallel simulated annealing using speculative computation, IEEE Transactions on Parallel and Distributed Systems, October 1991, 2 (4). [Google Scholar]
  • 33. S. R. WHITE, Concepts of scale in simulated annealing, In IEEE International Conference on Computer Design, 1984, pp. 646-651. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.