Neural Networks without Training for Optimization - Neural Networks: Methodology and Applications - page 486

6. Barr R.S., Golden B.L., Kelly J.P., Resende M.G.C., Stewart W.R. [1995], De-
signing and reporting on computational experiments with heuristic methods,
Journal of Heuristics , vol. 1, no 1, pp 9-32, 1995
7. Boudet T., Chaton P., Herault L., Gonon G., Jouanet L., Keller P. [1996], Thin
film designs by simulated annealing, Applied Optics , vol. 35, no 31, pp 6219-
6226, Nov. 1996
8. Brandt R.D., Wang Y., Laub A.J., Mitra S.K. [1988], Alternative networks for
solving the TSP and the list-matching problem, Proceedings of the International
Joint Conference on Neural Networks , San Diego, II, pp 333-340, 1988
9. Cerny V. [1985], A thermodynamical approach to the travelling salesman prob-
lem: an e cient simulated algorithm, Journal of Optimization Theory and Ap-
plications , n 45, pp 41-51, 1985
10. Charon I., Hudry O. [1996], Mixing different components of metaheuristics,
Chap. 35 de [Osman 1996]
11. Cichocki A., Unbehauen R. [1993], Neural Networks for Optimization and Signal
Processing , John Wiley & Sons Ed., 1993
12. Creutz M. [1983], Microcanonical Monte Carlo simulations, Physic Review Let-
ters , vol. 50, no 19, pp 411-1414, 1983
13. Dagli C. [1994], Artificial Neural Networks for Intelligent Manufacturing , Chap-
man & Hall, 1994
14. Derou D., Herault L. [1996], A new paradigm for particle tracking velocime-
try, based on graph-theory and pulsed neural networks, Developments in Laser
Techniques and Applications to Fluid Mechanics , pp 438-462, Springer-Verlag
Ed., 1996
15. Dowsland K.A. [1995], Simulated annealing, Chap. 2 of [Reeves 1995]
16. Garey M.R., Johnson D.S. [1979], Computers and intractability. A guide to the
theory of NP-completeness , W.H. Freeman and company Ed., 1979
17. Glover F., Laguna M. [1997], Tabu search , Kluwer Academic Publishers, 1997
18. Goldberg D.E. [1989], Genetic Algorithms in Search, Optimization and Machine
Learning , Addison Wesley, 1989
19. Goles E. [1995], Energy functions for neural networks, The Handbook of Brain
Theory and Neural Networks , The MIT Press, pp 363-367, 1995
20. Gondran M., Minoux M. [1995], Graphes et algorithmes , Editions Eyrolles, 1995
21. Gonzaga C.C. [1992], Path-following methods for linear programming, SIAM
Review 34(2) , pp 167-224, 1992
22. Hajek B. [1988], Cooling schedules for optimal annealing, Mathematics of oper-
ations research , vol. 13, no 2, pp 311-329, 1988
23. Herault L., Niez J.J. [1989], Neural networks & graph K-partitioning, Complex
Systems , vol. 3, no 6, pp 531-576, 1989
24. Herault L., Niez J.J. [1991], Neural networks & combinatorial optimization: a
study of NP-complete graph problems, Neural Networks: Advances and Appli-
cations , pp 165-213, Elsevier Science Publishers B.V. (North-Holland), 1991
25. Herault L., Horaud R. [1993], Figure-ground discrimination: a combinatorial
optimization approach, I.E.E.E. Transactions on Pattern Analysis and Machine
Intelligence , vol. 15, no 9, pp 899-914, 1993
26. Herault L. [1995a], Pulsed recursive neural networks & resource allocation - Part
1: static allocation, Proceedings of the 1995 SPIE's International Symposium on
Aerospace/Defense Sensing and Dual-Use Photonics , Orlando, Florida, USA, pp
229-240, April 1995