TY - JOUR
T1 - A graph coloring algorithm for large scale scheduling problems
AU - Lotfi, Vahid
AU - Sarin, Sanjiv
PY - 1986/1/1
Y1 - 1986/1/1
N2 - 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. © 1986.
AB - 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. © 1986.
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=0022582293&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=0022582293&origin=inward
U2 - 10.1016/0305-0548(86)90061-4
DO - 10.1016/0305-0548(86)90061-4
M3 - Article
SN - 0305-0548
VL - 13
SP - 27
EP - 32
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 1
ER -