Approximation Ratios of Graph Neural Networks for Combinatorial Problems.
Ryoma SatoMakoto YamadaHisashi KashimaPublished in: NeurIPS (2019)
Keyphrases
- combinatorial problems
- neural network
- constraint programming
- constraint satisfaction problems
- constraint satisfaction
- metaheuristic
- graph coloring
- combinatorial optimization
- traveling salesman problem
- solving hard
- branch and bound algorithm
- phase transition
- graph colouring
- genetic algorithm
- specific problems
- combinatorial search
- global constraints
- boolean satisfiability
- artificial neural networks
- integer programming
- constraint propagation
- hard combinatorial optimization problems
- approximation algorithms
- weighted graph
- graph matching
- particle swarm optimization