Search Results for author:
Found 2 papers, 1 papers with code
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization
In this paper, we present a novel formulation of Combinatorial Optimization Problems (COPs) as Markov Decision Processes (MDPs) that effectively leverages common symmetries of COPs to improve out-of-distribution robustness.
Combinatorial Optimization
Out-of-Distribution Generalization
On the Generalization of Neural Combinatorial Optimization Heuristics
Neural Combinatorial Optimization approaches have recently leveraged the expressiveness and flexibility of deep neural networks to learn efficient heuristics for hard Combinatorial Optimization (CO) problems.
