Heuristic algorithms and learning techniques: applications to the graph coloring problem

DOI10.1007/S10288-011-0193-5MaRDI QIDQ1935547zbMATH OpenOpenAlexFDO

Authors Daniel Cosmin Porumbel

Publication date 18 February 2013

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://tel.archives-ouvertes.fr/tel-00476541/file/these_porumbel.pdf

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(3)

• Neural network-based heuristic algorithms for hypergraph coloring problems with applications.
• Deep learning for the generation of heuristics in answer set programming: a case study of graph coloring
• scientific article; zbMATH DE number 861397 (Why is no real title available?)

This page was built for publication: Heuristic algorithms and learning techniques: applications to the graph coloring problem

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