Gröbner Bases and Nullstellensätze for Graph-Coloring Ideals.
Jesús A. De LoeraSusan MarguliesMichael PernpeintnerEric RiedlDavid RolnickGwen SpencerDespina StasiJon SwensonPublished in: CoRR (2014)
Keyphrases
- graph coloring
- numerically stable
- combinatorial problems
- job shop scheduling
- polynomial equations
- np complete problems
- phase transition
- numerical stability
- max sat
- scheduling problem
- constraint satisfaction problems
- hyper heuristics
- combinatorial optimization
- constraint satisfaction
- job shop scheduling problem
- satisfiability problem
- artificial bee colony
- bin packing
- heuristic search
- orders of magnitude
- evolutionary algorithm