Chromatic Scheduling and the Chromatic Number Problem
From MaRDI portal
Publication:5661694
DOI10.1287/mnsc.19.4.456zbMath0247.90028OpenAlexW2046610653MaRDI QIDQ5661694
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.4.456
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items
Chromatic scheduling and frequency assignment, Graph Coloring Lower Bounds from Decision Diagrams, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, Iterative coloring extension of a maximum clique, On edge orienting methods for graph coloring, A DSATUR-based algorithm for the equitable coloring problem, Simple decentralized graph coloring, Complexity of Coloring Random Graphs, Average-case complexity of backtrack search for coloring sparse random graphs, An exact approach for the vertex coloring problem, A variable neighborhood search for graph coloring., Algorithms for a shared resource scheduling problem in which some level of conflict is tolerable, Chromatic optimisation: Limitations, objectives, uses, references, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, The general \(\alpha \)-decomposition problem of fuzzy relations, A survey on vertex coloring problems, Co-2-plex vertex partitions, 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, Variable space search for graph coloring, Enumeration of the partitions with minimum diameter, Hybrid evolutionary algorithm for the b-chromatic number, A wide-ranging computational comparison of high-performance graph colouring algorithms, Embedding a novel objective function in a two-phased local search for robust vertex coloring, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Accelerating backtrack search with a best-first-search strategy, Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices, A note on the complexity of the chromatic number problem, Some sequential graph colouring algorithms, A branch-and-cut algorithm for partition coloring, A NEW APPROACH TO THE VERTEX COLORING PROBLEM, An uncertain chromatic number of an uncertain graph based on \(\alpha \)-cut coloring, EPCOT: An efficient procedure for coloring optimally with Tabu Search, Preventing redundant solutions in partial enumeration algorithms, A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing, A graph colouring model for assigning a heterogeneous workforce to a given schedule, An introduction to timetabling, A search space ``cartography for guiding graph coloring heuristics, The multi-facility min-max Weber problem, Numerical experiences with graph coloring algorithms, Graph coloring with decision diagrams
