Two new papers
Two new papers with my PhD student Frej Knutar Lewander.
One is a very long journal article where we analyse implementations of invariant graphs in local search. Invariant graphs are incremental data structures that keep track of the current cost during local search as the solver explores neighbourhoods of moves.
The other was presented at CP 2025 and is a simple technique for selecting freeze variables for large neighbourhood search. Even though the idea is simple, it is very effective and as far as we know hasn’t been tried before. We had the idea by looking at invariant graphs of constraint problems in local search.