NN Models for Combinatorial Problems

  • Xiang-Sun Zhang
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 46)


In this chapter we consider applications of neural networks to combinatorial optimization problems that can be formulated or approximated as the following combinatorial quadratic minimization:
$$\left( p \right)\,_{subject\,to\,y \in {{\left\{ {1, - 1} \right\}}^n}}^{Minimize\, - {y^T}Wy + {T^T}y}$$
where W is an n × n matrix, T ∈ ℝ n . In some cases where it is specified, y ∈ {0,1} n .


Energy Function Neural Network Model Travel Salesman Problem Combinatorial Problem Image Neuron 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Xiang-Sun Zhang
    • 1
  1. 1.Academy of Mathematics and Systems, Institute of Applied MathematicsChinese Academy of SciencesChina

Personalised recommendations