| Article ID: | iaor19981901 |
| Country: | China |
| Volume: | 9 |
| Issue: | 1 |
| Start Page Number: | 50 |
| End Page Number: | 54 |
| Publication Date: | Jan 1996 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Chen J.F., Xia S.W. |
| Keywords: | neural networks |
More and more attention has been paid to the Hybrid Neural Network (HNN) algorithm since it was used by Hopfield and Tank to solve the Travelling Salesman Problem, in 1985. However, the algorithm can only solve the pure 0–1 linear programs with equality constraints, and many tests showed that it is unreliable. This paper proposes an HNN-type algorithm which can solve some pure 0–1 linear programs with inequality constraints and guarantee to find their ‘near-optimal’ solutions. Finally, an example is given.