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: Nat. Mac. Intell. (2023)
Keyphrases
- combinatorial optimization problems
- greedy algorithms
- knapsack problem
- combinatorial optimization
- neural network
- discrete optimization
- shortest path problem
- greedy algorithm
- continuous optimization problems
- optimization problems
- exact algorithms
- metaheuristic
- optimal solution
- dynamic programming
- lp relaxation
- job shop scheduling problem
- traveling salesman problem
- job shop scheduling
- directed graph
- simulated annealing
- random walk
- graph structure
- np hard
- min cost
- directed acyclic graph
- branch and bound
- objective function
- genetic algorithm
- ant colony optimization
- search algorithm
- artificial neural networks
- upper bound
- min cut
- search space
- evolutionary algorithm
- graph partitioning
- weighted graph
- branch and bound algorithm
- linear programming
- tabu search