A graph coloring algorithm for large scale scheduling problems (Q1096533): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(86)90061-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087316231 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Final examination scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for the chromatic number of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Loading Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Complexity of Near-Optimal Graph Coloring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling to reduce conflict in meetings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4065570 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A graph coloring algorithm for large scheduling problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5581642 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5670645 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661516 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A system for computing university examination timetables / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 13:54, 18 June 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
