An exact algorithm with learning for the graph coloring problem (Q337154): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68T05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650719 / rank
 
Normal rank
Property / zbMATH Keywords
 
backtracking
Property / zbMATH Keywords: backtracking / rank
 
Normal rank
Property / zbMATH Keywords
 
clause learning
Property / zbMATH Keywords: clause learning / rank
 
Normal rank
Property / zbMATH Keywords
 
graph coloring
Property / zbMATH Keywords: graph coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
SAT
Property / zbMATH Keywords: SAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EXTRACOL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2014.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988588521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring approaches for a satellite range scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph-theoretical model for cyclic register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new \textsf{DSATUR}-based algorithm for exact vertex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs by iterated local search traversing feasible and infeasible solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant colony optimisation heuristic for graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory algorithm for the \(k\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalised graph colouring by a hybrid of local search and constraint programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A wide-ranging computational comparison of high-performance graph colouring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloration neighbourhood search with forward checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Metaheuristic Approach for the Vertex Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search space ``cartography'' for guiding graph coloring heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring large graphs based on independent set extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum annealing of the graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding critical subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the chromatic number by means of critical graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:48, 12 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm with learning for the graph coloring problem
scientific article

    Statements

    An exact algorithm with learning for the graph coloring problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    backtracking
    0 references
    clause learning
    0 references
    graph coloring
    0 references
    SAT
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references