Randomized compression of rank-structured matrices accelerated with graph coloring.
James LevittPer-Gunnar MartinssonPublished in: J. Comput. Appl. Math. (2024)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- phase transition
- np complete problems
- scheduling problem
- max sat
- hyper heuristics
- constraint satisfaction problems
- genetic programming
- neural network
- satisfiability problem
- genetic algorithm ga
- constraint programming
- linear programming
- artificial bee colony
- np hard
- evolutionary algorithm