A graph coloring algorithm for large scale scheduling problems (Q1096533)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A graph coloring algorithm for large scale scheduling problems |
scientific article; zbMATH DE number 4031378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph coloring algorithm for large scale scheduling problems |
scientific article; zbMATH DE number 4031378 |
Statements
A graph coloring algorithm for large scale scheduling problems (English)
0 references
1986
0 references
Graph coloring finds application in a variety of conflict resolution problems, such as examination scheduling. Since it is an NP-complete problem, a number of heuristic methods have been suggested for its solution. We present a new heuristic solution procedure designed to produce good suboptimal solutions with very little computational effort.
0 references
conflict resolution
0 references
examination scheduling
0 references
NP-complete
0 references
heuristic
0 references
suboptimal solutions
0 references
