An adaptive, multiple restarts neural network algorithm for graph coloring
type: Item
instance of: scholarly article
title: An adaptive, multiple restarts neural network algorithm for graph coloring
zbMATH Open document ID: 0913.90258
DOI: 10.1016/0377-2217(96)00043-4
published in: European Journal of Operational Research
publication date: 1998-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1212189
zbMATH Keywords: graph coloring
zbMATH Keywords: neural network
author: Arun Jagota
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00043-4
OpenAlex ID: W2044518971
cites work: Q3994799
cites work: Every planar map is four colorable. I: Discharging
cites work: Q4230322
cites work: A new adaptive multi-start technique for combinatorial global optimizations
cites work: Q5422499
cites work: Q5687258
cites work: An introduction to timetabling
cites work: An application of graph coloring to printed circuit testing
cites work: Neural networks and physical systems with emergent collective computational abilities.
cites work: Neurons with graded response have collective computational properties like those of two-state neurons.
cites work: ``Neural'' computation of decisions in optimization problems
cites work: Q5687255
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Q4142699
cites work: A graph coloring algorithm for large scheduling problems
cites work: Q5687261
cites work: On the hardness of approximating minimization problems
cites work: Multicolor ICCG Methods for Vector Computers
cites work: Q4003539
description: scientific article; zbMATH DE number 1212189