1. A.L. Barker, D.E. Brown and W.N. Martin, A neural network implementation of a data association algorithm, Technical Report, Institute for Parallel Computation, School of Engineering and Applied Science, University of Virginia, Charlottesville, VA (1988).
2. E.B. Baum, Towards practical neural computation for combinatorial optimization problems, AIP Conf. Proc. 151 (1986) 53–58.
3. R.D. Brandt, Y. Wang, A.J. Laub and S.K. Mitra, Alternative networks for solving the Traveling Salesman Problem and the list-matching problem,IEEE Int. Conf. on Neural Networks, vol. 2, San Diego, CA (July, 1988) pp. 333–340.
4. J. Bruck and J.W. Goodman, On the power of neural networks for solving hard problems, Technical Report, Department of Electrical Engineering, Stanford University, Palo Alto, CA, presented at theIEEE Neural Information Processing Systems Conf., Denver, CO (November 1987).
5. D.J. Burr, An improved elastic net method for the Traveling Salesman Problem,IEEE Int. Conf. on Neural Networks, vol. 1, San Diego, CA (July 1988) pp. 69–76.