Variational Annealing on Graphs for Combinatorial Optimization.
Sebastian SanokowskiWilhelm BerghammerSepp HochreiterSebastian LehnerPublished in: NeurIPS (2023)
Keyphrases
- combinatorial optimization
- simulated annealing
- graph theory
- combinatorial optimization problems
- metaheuristic
- traveling salesman problem
- mathematical programming
- evolutionary algorithm
- branch and bound
- optimization problems
- combinatorial problems
- branch and bound algorithm
- tabu search
- hard combinatorial optimization problems
- graph matching
- quadratic assignment problem
- vehicle routing problem
- image segmentation
- graph model
- memetic algorithm
- benchmark problems
- single machine scheduling problem
- path relinking
- combinatorial search
- multiscale
- graph structure
- directed graph
- variational methods
- variational framework
- particle swarm optimization