Reply to: Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems.
Martin J. A. SchuetzJ. Kyle BrubakerHelmut G. KatzgraberPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization problems
- greedy algorithms
- knapsack problem
- combinatorial optimization
- neural network
- discrete optimization
- greedy algorithm
- shortest path problem
- continuous optimization problems
- exact algorithms
- optimization problems
- optimal solution
- simulated annealing
- metaheuristic
- dynamic programming
- job shop scheduling problem
- job shop scheduling
- lp relaxation
- ant colony optimization
- graph model
- traveling salesman problem
- vehicle routing problem
- search algorithm
- np hard
- branch and bound algorithm
- bipartite graph
- min cost
- random walk
- tabu search
- genetic algorithm
- search space
- branch and bound
- min cut
- interval data
- machine learning
- artificial neural networks
- directed acyclic graph
- search procedure
- graph structure
- graph matching