The graph coloring problem: A neuronal network approach

DOI10.1016/j.ejor.2007.08.034zbMath1147.68611OpenAlexW2042478873MaRDI QIDQ930943

Javier Yáñez, Pedro M. Talaván

Publication date: 24 June 2008

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.08.034

zbMATH Keywords

Hopfield networkartificial neural networksgraph coloring problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

On some applications of the selective graph coloring problem ⋮ Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ A NEW APPROACH TO THE VERTEX COLORING PROBLEM ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach ⋮ A kind of BP neural network algorithm based on grey interval ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING

Cites Work

• Unnamed Item
• ``Neural computation of decisions in optimization problems
• An adaptive, multiple restarts neural network algorithm for graph coloring
• A continuous Hopfield network equilibrium points algorithm
• The generalized quadratic knapsack problem. A neuronal network approach
• Neurons with graded response have collective computational properties like those of two-state neurons.

This page was built for publication: The graph coloring problem: A neuronal network approach