Decomposable polymatroids and connections with graph coloring.
Joseph E. BoninCarolyn ChunPublished in: Eur. J. Comb. (2020)
Keyphrases
- graph coloring
- combinatorial problems
- phase transition
- job shop scheduling
- np complete problems
- max sat
- constraint satisfaction problems
- scheduling problem
- hamiltonian cycle
- np complete
- hyper heuristics
- sat problem
- constraint satisfaction
- metaheuristic
- genetic programming
- sat solvers
- global constraints
- tabu search
- neural network