Showing 2026Show all
2 papers · 1 filter
cs.LG2026
Regularized Large Neighborhood Search
Germain Vivier-Ardisson, Laurent Demonet, Axel Parmentier +1
Operations research practitioners typically tackle NP-hard combinatorial problems using large neighborhood search (LNS), a scalable heuristic that iteratively refines a current sol…
cs.LG2026
Differentiable Knapsack and Top-k Operators via Dynamic Programming
Germain Vivier-Ardisson, Michaël E. Sander, Axel Parmentier +1
Knapsack and Top-k operators are useful for selecting discrete subsets of variables. However, their integration into neural networks is challenging as they are piecewise constant,…