Variational Annealing on Graphs for Combinatorial Optimization.
Sebastian SanokowskiWilhelm BerghammerSepp HochreiterSebastian LehnerPublished in: CoRR (2023)
Keyphrases
- combinatorial optimization
- simulated annealing
- graph theory
- combinatorial optimization problems
- metaheuristic
- branch and bound
- traveling salesman problem
- branch and bound algorithm
- mathematical programming
- genetic algorithm
- combinatorial problems
- evolutionary algorithm
- vehicle routing problem
- tabu search
- hard combinatorial optimization problems
- graph matching
- optimization problems
- exact algorithms
- image segmentation
- spanning tree
- computer vision
- benchmark problems
- graph structure
- graph databases
- memetic algorithm
- path relinking
- greedy algorithm
- directed graph
- graphical models
- denoising
- upper bound
- single machine scheduling problem
- objective function