Reply to: Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set.
Martin J. A. SchuetzJ. Kyle BrubakerHelmut G. KatzgraberPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization problems
- maximum independent set
- greedy algorithms
- knapsack problem
- graph theory
- combinatorial optimization
- neural network
- discrete optimization
- continuous optimization problems
- greedy algorithm
- graph theoretic
- independent set
- optimization problems
- shortest path problem
- metaheuristic
- ant colony optimization
- optimal solution
- traveling salesman problem
- exact algorithms
- simulated annealing
- dynamic programming
- genetic algorithm
- job shop scheduling
- minimum spanning tree
- branch and bound
- search algorithm
- lp relaxation
- directed graph
- evolutionary algorithm
- branch and bound algorithm
- objective function
- graph cuts
- minmax regret
- tabu search