Chromatic Scheduling and the Chromatic Number Problem
From MaRDI portal
Cited in
(46)- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
- A search space ``cartography for guiding graph coloring heuristics
- Numerical experiences with graph coloring algorithms
- Chromatic optimisation: Limitations, objectives, uses, references
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- A note on the complexity of the chromatic number problem
- A graph colouring model for assigning a heterogeneous workforce to a given schedule
- Chromatic scheduling and frequency assignment
- A variable neighborhood search for graph coloring.
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- An uncertain chromatic number of an uncertain graph based on -cut coloring
- EPCOT: An efficient procedure for coloring optimally with Tabu Search
- Accelerating backtrack search with a best-first-search strategy
- Graph coloring with decision diagrams
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- On edge orienting methods for graph coloring
- Simple decentralized graph coloring
- Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable
- The general \(\alpha \)-decomposition problem of fuzzy relations
- A semidefinite programming-based heuristic for graph coloring
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Efficient algorithms for finding critical subgraphs
- An adaptive memory algorithm for the k-coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A new approach to the vertex coloring problem
- A survey on vertex coloring problems
- A branch-and-cut algorithm for partition coloring
- Some sequential graph colouring algorithms
- A DSATUR-based algorithm for the equitable coloring problem
- Average-case complexity of backtrack search for coloring sparse random graphs
- Preventing redundant solutions in partial enumeration algorithms
- An exact approach for the vertex coloring problem
- Iterative coloring extension of a maximum clique
- Complexity of coloring random graphs: an experimental study of the hardest region
- Co-2-plex vertex partitions
- Graph coloring lower bounds from decision diagrams
- Hybrid evolutionary algorithm for the b-chromatic number
- Enumeration of the partitions with minimum diameter
- Graph coloring problem solving using Monte Carlo tree search and deep reinforcement learning
- Optimality of DSatur algorithm on chordal graphs
- A faster algorithm for the 4-coloring problem
- An introduction to timetabling
- The multi-facility min-max Weber problem
- Variable space search for graph coloring
This page was built for publication: Chromatic Scheduling and the Chromatic Number Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5661694)
