COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems.
Hao TianSourav MedyaWei YePublished in: CoRR (2023)
Keyphrases
- combinatorial problems
- search space
- metaheuristic
- constraint satisfaction problems
- combinatorial search
- constraint programming
- combinatorial optimization
- constraint satisfaction
- graph coloring
- traveling salesman problem
- phase transition
- branch and bound algorithm
- graph colouring
- solving hard
- tabu search
- neural network
- ant colony optimization
- simulated annealing
- search algorithm
- constraint propagation
- search strategy
- hard combinatorial optimization problems
- network architecture
- branch and bound
- integer programming
- heuristic search
- hill climbing
- graph matching
- optimal solution
- sat encodings
- optimization problems
- genetic algorithm