Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481362 | European Journal of Operational Research | 2008 | 12 Pages |
Abstract
Solution of an optimization problem with linear constraints through the continuous Hopfield network (CHN) is based on an energy or Lyapunov function that decreases as the system evolves until a local minimum value is attained. This approach is extended in to optimization problems with quadratic constraints. As a particular case, the graph coloring problem (GCP) is analyzed. The mapping procedure and an appropriate parameter-setting procedure are detailed. To test the theoretical results, some computational experiments solving the GCP are shown.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Pedro M. Talaván, Javier Yáñez,