.png){kind=icon}
返回
The graph coloring problem:: A neuronal network approach
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.08.034.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (c) 2007 Elsevier B.V. All rights reserved.
Keyword:
artificial neural networks
Hopfield network
graph coloring problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Effect of volume fiber and crack length on interlaminar fracture properties of glass fiber reinforced polyester composites (GF/PO composites).png)
Mechanics
OAAI
MechanicsIF0
OAAI分享收藏
分享收藏分享收藏
查看更多内容