An adaptive, multiple restarts neural network algorithm for graph coloring

DOI10.1016/0377-2217(96)00043-4zbMath0913.90258OpenAlexW2044518971MaRDI QIDQ1268156

Arun K. Jagota

Publication date: 18 October 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(96)00043-4

zbMATH Keywords

neural networkgraph coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The graph coloring problem: A neuronal network approach ⋮ INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING

Cites Work

• An introduction to timetabling
• ``Neural computation of decisions in optimization problems
• Every planar map is four colorable. I: Discharging
• A new adaptive multi-start technique for combinatorial global optimizations
• Multicolor ICCG Methods for Vector Computers
• A graph coloring algorithm for large scheduling problems
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• An application of graph coloring to printed circuit testing
• On the hardness of approximating minimization problems
• Neural networks and physical systems with emergent collective computational abilities.
• Neurons with graded response have collective computational properties like those of two-state neurons.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An adaptive, multiple restarts neural network algorithm for graph coloring