Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
Global Difference Constraint Propagation for Constraint Programming
Lucas Kletzander, Jip J. Dekker, Andreas Schutt +1
Difference constraints of the form are well studied, with efficient algorithms for satisfaction and implication, because of their connection to shortest paths. Finit…
cs.AI2026
An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers
Ida Gjergji, Lucas Kletzander, Nysret Musliu +1
A new variant of the classic capacitated facility location problem, which considers incompatibilities between customers, has recently been introduced in the literature. This proble…
cs.AI2025
Key Principles in Cross-Domain Hyper-Heuristic Performance
Václav Sobotka, Lucas Kletzander, Nysret Musliu +1
Cross-domain selection hyper-heuristics aim to distill decades of research on problem-specific heuristic search algorithms into adaptable general-purpose search strategies. In this…