A graph coloring algorithm for large scale scheduling problems (Q1096533): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:28, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A graph coloring algorithm for large scale scheduling problems |
scientific article |
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
