Neural networks for NP-complete problems

Nonlinear Analysis, Theory, Methods and Applications

Volumn 30, Issue 3, 1997, Pages 1617-1624

  Budinich, Marco ^a  

^a UNIVERSITY OF TRIESTE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043133411     PISSN: 0362546X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0362-546X(97)00308-8     Document Type: Article

References (22)

1. B. Angéniol, G. de La Croix Vaubois and J.-Y. Le Texier, Self Organising Feature Maps and the Travelling Salesman Problem, Neural Networks 1 1988 pp. 289-293;
2. L.E. Baum and J.A. Eagon, An Inequality with Applications to Statistical Estimation for Probabilistic Functions of Markov Processes and to a Model for Ecology, Bulletin of the American Mathematical Society 73 (1967), pp. 360-363;
3. Immanuel M. Bomze, Evolution Towards the Maximum Clique, preprint;
4. Immanuel M. Bomze, Marcello Pelillo and Robert Giacomini, Evolutionary Approach to the Maximum Clique Problem: Empirical Evidence on a Larger Scale, preprint;
5. M. Budinich, A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing, to appear in: Neural Computation;
6. st International Conference Mathematics of Neural Networks and Application (MANNA), 3-7 July 1995, Lady Margaret Hall, Oxford, U.K., to appear in: Annals of Mathematics in Artificial Intelligence - Special Volume;
7. L.A.V. de Caravalho and V.C. Barbosa, in: Proceedings of the International NN conference (INNS), Paris, July 9-13, 1990, Kluwer Academic Publisher, Volume 1 p. 254;
8. R. Durbin and D. Willshaw, An Analogue Approach to the Travelling Salesman Problem using an Elastic Net Method, Nature 336 1987 pp. 689-691;
9. F. Favata and R. Walker, A Study of the Application of Kohonen-type Neural Networks to the Travelling Salesman Problem, Biological Cybernetics 64 1991 pp. 463-468;
10. J.J. Hopfield and D.W. Tank, "Neural" Computation of Decisions in Optimization Problems, Biological Cybernetics 52 1985 pp. 141-152;
11. th Colloquium on Automata, Languages and Programming, 1990 Springer-Verlag New York, pp. 446-461;
12. D.S. Johnson and M. Trick (editors), Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, in press;
13. rd Ed. 1989) Springer-Verlag Berlin Heidelberg;
14. E.L. Lawler, J.K. Lenstra , A.G. Rinnoy Kan and D.B. Shmoys (editors), The Traveling Salesman Problem - A Guided Tour of Combinatorial Optimization, John Wiley & Sons, New York 1990, IV Reprint, pp. x 474;
15. Theodore Samuel Motzkin and E. G. Straus, Maxima for Graphs and a New Proof of a Theorem of Turán, Canadian Journal of Mathematics 17 1965, pp. 533-540;
16. Panos M. Pardalos And Jue Xue, The Maximum Clique Problem, Journal of Global Optimization 4 1994, pp. 301-328;
17. Marcello Pelillo, Relaxation Labeling Networks for the Maximum Clique Problem, Journal of Artificial Neural Networks 2 #4, (1995), pp. 213-227;
18. C. Peterson and B. Söderberg, A New Method for Mapping Optimization Problems Onto Neural Networks, International Journal of Neural Systems 1(1) 1989, pp. 3-22;
19. H. Ritter, T. Martinetz and K. Schulten, Neural Computation and Self-Organizing Maps, Addison-Wesley Publishing Company, Reading Massachusetts 1992, pp. 306;
20. M. Simmen, Neural Network Optimization, PhD Thesis, Physics Department -University of Edinburgh, 1992, Technical Report 92/521;
21. Ch. Von der Malsburg, Self-Organising of Orientation Sensitive Cells in Striate Cortex, Kybernetik 14 (1973) pp. 85-100;
22. G.V. Wilson and G.D. Pawley, Biological Cybernetics 58 1988 p. 63.