Abstract
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:
where W is an n × n matrix, T ∈ ℝn. In some cases where it is specified, y ∈ {0,1}n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Zhang, XS. (2000). NN Models for Combinatorial Problems. In: Neural Networks in Optimization. Nonconvex Optimization and Its Applications, vol 46. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3167-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3167-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4836-6
Online ISBN: 978-1-4757-3167-5
eBook Packages: Springer Book Archive