Tverberg's Theorem and Graph Coloring.
Alexander EngströmPatrik NorénPublished in: Discret. Comput. Geom. (2014)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- scheduling problem
- hamiltonian cycle
- max sat
- constraint satisfaction problems
- artificial bee colony
- hyper heuristics
- constraint programming
- branch and bound algorithm
- traveling salesman problem
- job shop scheduling problem
- constraint satisfaction
- cost function
- computational complexity
- learning algorithm