Chromatic optimisation: Limitations, objectives, uses, references
From MaRDI portal
Publication:1162931
DOI10.1016/S0377-2217(82)80002-7zbMath0482.90066OpenAlexW2028301423MaRDI QIDQ1162931
Dominique de Werra, Jakob Krarup
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(82)80002-7
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Coloring of graphs and hypergraphs (05C15)
Related Items
A generalization of interval edge-colorings of graphs, The mutual exclusion scheduling problem for permutation and comparability graphs., Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths, Weighted graphs and university course timetabling, Bounded vertex colorings of graphs, Linear combinations of heuristics for examination timetabling, Mutual exclusion scheduling with interval graphs or related classes. I, An introduction to timetabling, What is my objective function?, A generalized class-teacher model for some timetabling problems, Equitable colorings of bounded treewidth graphs, On equitable \(\Delta\)-coloring of graphs with low average degree
Cites Work
- Regular and canonical colorings
- n-tuple colorings and associated graphs
- Méthode et théorème général de coloration des aretes d'un multigraphe
- Brooks' graph-coloring theorem and the independence number
- An extension of Brooks' theorem to n-degenerate graphs
- Every planar map is four colorable. I: Discharging
- Investigations on an edge coloring problem
- Scheduling in Sports
- On colouring random graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- Compactness and balancing in scheduling
- New methods to color the vertices of a graph
- A bibliographic survey of edge‐colorings
- An Algorithm for Determining the Chromatic Number of a Graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- An inequality for the chromatic number of a graph
- New proof of brooks' theorem
- An algorithm for the chromatic number of a graph
- Chromatic Scheduling and the Chromatic Number Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
