Neural network-based heuristic algorithms for hypergraph coloring problems with applications.
type: Item
instance of: scholarly article
title: Neural network-based heuristic algorithms for hypergraph coloring problems with applications.
zbMATH Open document ID: 1047.68092
DOI: 10.1016/S0743-7315(03)00064-9
author: Dmitri Kaznachey
author: Sajal K. Das
author: Arun Jagota
published in: Journal of Parallel and Distributed Computing
publication date: 2003-12-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2013071
zbMATH Keywords: Hopfield network
zbMATH Keywords: Hypergraph coloring
zbMATH Keywords: Combinatorial optimization
MaRDI profile type: Publication
full work available at URL: s0743-7315(03)00064-9
OpenAlex ID: W2089936792
Recommended article: The graph coloring problem: A neuronal network approach
Recommended article: An adaptive, multiple restarts neural network algorithm for graph coloring
Recommended article: Heuristic algorithms and learning techniques: applications to the graph coloring problem
Recommended article: Dynamical Hysteresis Neural Networks for Graph Coloring Problem
Recommended article: Neural network model of equitable coloring of graphs
Recommended article: A Large Neighborhood Search Heuristic for Graph Coloring
Recommended article: Heuristic procedure neural networks for the CMST problem
Recommended article: Advances in Neural Networks – ISNN 2005
description: scientific article; zbMATH DE number 2013071