3 papers
cs.LG2026
A First Guess is Rarely the Final Answer: Learning to Search in the Traveling Salesperson Problem
Andoni Irazusta Garmendia
Most neural solvers for the Traveling Salesperson Problem (TSP) are trained to output a single solution, even though practitioners rarely stop there: at test time, they routinely s…
cs.NE2026
Enabling Population-Based Architectures for Neural Combinatorial Optimization
Andoni Irazusta Garmendia, Josu Ceberio, Alexander Mendiburu
Neural Combinatorial Optimization (NCO) has mostly focused on learning policies, typically neural networks, that operate on a single candidate solution at a time, either by constru…
cs.NE2024
MARCO: A Memory-Augmented Reinforcement Framework for Combinatorial Optimization
Andoni I. Garmendia, Quentin Cappart, Josu Ceberio +1
Neural Combinatorial Optimization (NCO) is an emerging domain where deep learning techniques are employed to address combinatorial optimization problems as a standalone solver. Des…