Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems.
Stefan BoettcherPublished in: Nat. Mac. Intell. (2023)
Keyphrases
- combinatorial optimization problems
- greedy algorithms
- knapsack problem
- combinatorial optimization
- neural network
- greedy algorithm
- continuous optimization problems
- shortest path problem
- discrete optimization
- exact algorithms
- optimization problems
- metaheuristic
- optimal solution
- job shop scheduling problem
- dynamic programming
- traveling salesman problem
- job shop scheduling
- simulated annealing
- lp relaxation
- weighted graph
- directed graph
- np hard
- graph model
- artificial neural networks
- min cost
- graph structure
- cost function
- ant colony optimization
- vehicle routing problem
- interval data
- branch and bound algorithm
- evolutionary algorithm
- random walk
- directed acyclic graph
- search algorithm
- feasible solution
- objective function
- genetic algorithm