BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization.
Darko DrakulicSofia MichelFlorian MaiArnaud SorsJean-Marc AndreoliPublished in: NeurIPS (2023)
Keyphrases
- combinatorial optimization
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- branch and bound algorithm
- traveling salesman problem
- combinatorial problems
- branch and bound
- optimization problems
- mathematical programming
- single machine scheduling problem
- lower bound
- graph theory
- neural network
- quadratic assignment problem
- hard combinatorial optimization problems
- max flow min cut
- vehicle routing problem
- worst case
- upper bound
- image segmentation