Author:
Talaván Pedro M.,Yáñez Javier
Subject
Artificial Intelligence,Cognitive Neuroscience
Reference16 articles.
1. Aiyer, S. V. B. (1991). Solving combinatorial optimization problems using neural networks. Technical report CUED/F-INFENG/TR 89. Cambridge University Engineering Departament, Cambridge, UK.
2. A new upper bound for the 0–1 quadratic knapsack problem;Billionnet;European Journal of Operational Research,1999
3. Brandt, R. D., Wang, Y., Laub, A. J., & Mitra, S. K. (1988). Alternative networks for solving the traveling salesman problem and the list-matching problem. Proceedings of the international conference on neural networks (ICNN'88), San Diego (Vol. II) (pp. 333–340).
4. Quadratic knapsack problems;Gallo;Mathematical Programming Study,1980
5. An analytical framework for optimizing neural networks;Gee;Neural Networks,1993
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献