Neural network-based heuristic algorithms for hypergraph coloring problems with applications.

DOI10.1016/S0743-7315(03)00064-9zbMATH Open1047.68092OpenAlexW2089936792MaRDI QIDQ1414734

Sajal K. Das, Dmitri Kaznachey, Arun Jagota

Publication date: 4 December 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00064-9

zbMATH Keywords

Combinatorial optimizationHopfield networkHypergraph coloring

Mathematics Subject Classification ID

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

Related Items (1)

A polyhedral approach to the \textit{alldifferent} system

Recommendations

• The graph coloring problem: A neuronal network approach 👍 👎
• An adaptive, multiple restarts neural network algorithm for graph coloring 👍 👎
• Heuristic procedure neural networks for the CMST problem 👍 👎
• Heuristic algorithms and learning techniques: applications to the graph coloring problem 👍 👎
• Neural network model of equitable coloring of graphs 👍 👎
• A Large Neighborhood Search Heuristic for Graph Coloring 👍 👎
• Dynamical Hysteresis Neural Networks for Graph Coloring Problem 👍 👎
• Advances in Neural Networks – ISNN 2005 👍 👎

This page was built for publication: Neural network-based heuristic algorithms for hypergraph coloring problems with applications.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1414734)