Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
From MaRDI portal
Publication:6579767
DOI10.1145/3588869MaRDI QIDQ6579767FDOQ6579767
Authors: Loïc Crombez, Guilherme D. Da Fonseca, Florian Fontan, Yan Gerard, Aldo Gonzalez-Lorenzo, Pascal Lafourcade, Luc Libralesso, Benjamin Momège, Jack Spalding-Jamieson, Dawei Zheng 
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A branch-and-cut algorithm for graph coloring
- A graph coloring algorithm for large scheduling problems
- New methods to color the vertices of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Title not available (Why is that?)
- Hybrid evolutionary algorithms for graph coloring
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- An exact method for graph coloring
- Quantum annealing of the graph coloring problem
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Title not available (Why is that?)
- Small Maximal Independent Sets and Faster Exact Graph Coloring
- Exact weighted vertex coloring via branch-and-price
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- On Monte Carlo tree search for weighted vertex coloring
- Optimality clue for graph coloring problem
- Shadoks Approach to Low-Makespan Coordinated Motion Planning
- Shadoks approach to minimum partition into plane subgraphs (CG challenge)
- Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
- Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
- SAT-based local search for plane subgraph partitions (CG challenge)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
Cited In (2)
This page was built for publication: Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579767)
