Hyperoctahedral Eulerian Idempotents, Hodge Decompositions, and Signed Graph Coloring Complexes.
Benjamin BraunSarah Crown RundellPublished in: Electron. J. Comb. (2014)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- np complete problems
- phase transition
- constraint satisfaction problems
- max sat
- scheduling problem
- hyper heuristics
- partial differential equations
- constraint satisfaction
- distributed constraint optimization problems
- artificial bee colony
- satisfiability problem
- constraint programming
- combinatorial optimization
- orders of magnitude
- genetic algorithm
- neural network