Planar Graph Coloring with an Uncooperative Partner.
Hal A. KiersteadWilliam T. TrotterPublished in: Planar Graphs (1991)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- constraint satisfaction problems
- phase transition
- hamiltonian cycle
- np complete problems
- scheduling problem
- hyper heuristics
- max sat
- job shop scheduling problem
- constraint programming
- artificial bee colony
- branch and bound algorithm
- combinatorial optimization problems
- constraint satisfaction
- multi objective
- search space