Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix.
Harold SzuPublished in: ICNN (1988)
Keyphrases
- input data
- input pattern
- optimal solution
- singular values
- gradient vector
- search space
- distance matrix
- dynamic programming
- non binary
- learning algorithm
- qr decomposition
- rows and columns
- similarity matrix
- constrained optimization
- combinatorial optimization
- ant colony optimization
- np hard
- k means
- computational complexity
- covariance matrix
- convex hull
- linear programming
- optimization problems
- cost function
- coefficient matrix
- objective function
- sparse matrices
- neural network