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: Nat. Mac. Intell. (2023)
Keyphrases
- combinatorial optimization problems
- maximum independent set
- greedy algorithms
- knapsack problem
- combinatorial optimization
- graph theory
- neural network
- discrete optimization
- continuous optimization problems
- greedy algorithm
- graph theoretic
- independent set
- optimization problems
- shortest path problem
- metaheuristic
- job shop scheduling
- simulated annealing
- dynamic programming
- exact algorithms
- traveling salesman problem
- search algorithm
- optimal solution
- ant colony optimization
- job shop scheduling problem
- np hard
- genetic algorithm
- branch and bound
- branch and bound algorithm
- minimum spanning tree
- lp relaxation
- min cost
- minmax regret
- directed acyclic graph
- complex networks
- aco algorithms
- social network analysis
- particle swarm optimization
- special case