| R. Sharda and J. Wang
Neural networks and operations research/management science
| 227-229 |
| E. Alpaydin, I.K. Altinel and N. Aras
Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
| 230-243 |
| A. Cichocki, R. Unbehauen,
K. Weinzierl and R. Holzel
A new neural network for solving linear programming problems
| 244-256 |
| A. Jagota
An adaptive, multiple restarts neural network algorithm for graph coloring
| 257-270 |
| H.E. Mausser and M.J. Magazine
Comparison of neural and heuristic methods for a timetabling problem
| 271-287 |
| I. Sabuncuoglu and B. Gurgun
A neural network model for scheduling problems
| 288-299 |
| K. Smith, M. Palaniswami and
M. Krishnamoorthy
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
| 300-316 |
| S. Vaithyanathan, L.I. Burke and
M.A. Magent
Massively parallel analog tabu search using neural networks applied to simple plant location problems
| 317-330 |
| Y. Yuan and L. Wang
A neural network approach to solve the stable matching problem
| 331-345 |
| P.V.(. Balakrishnan, M.C. Cooper,
V.S. Jacob and P.A. Lewis
Comparative performance of the FSCL neural net and K-means algorithm for market segmentation
| 346-357 |
| J.W. Denton and M.S. Hung
A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks
| 358-368 |
| S.W. Palocsay, S.P. Stevens,
R.G. Brookshire, W.J. Sacco, W.S. Copes,
R.F. Buckman Jr. and J.S. Smith
Using neural networks for trauma outcome evaluation 1
| 369-386 |
| D.M. Steiger and R. Sharda
Analyzing mathematical models with inductive learning networks
| 387-401 |
| P. Mangiameli, S.K. Chen and D. West
A comparison of SOM neural network and hierarchical clustering methods
| 402-417 |
| S. Piramuthu
Feed-forward neural networks and feature construction with correlation information: an integrated framework
| 418-427 |
| M.A. Nour and G.R. Madey
Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
| 428-448 |
Only a few issues a year have larger print-runs to fulfill these
requests, therefore requests for one specific issue