Affordable Access

The graph coloring problem: A neuronal network approach

Authors
Journal
European Journal of Operational Research
0377-2217
Publisher
Elsevier
Publication Date
Volume
191
Issue
1
Identifiers
DOI: 10.1016/j.ejor.2007.08.034
Keywords
  • Artificial Neural Networks
  • Hopfield Network
  • Graph Coloring Problem
Disciplines
  • Computer Science

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.