We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarantee completeness.
Daniel Gatica-Perez, Lakmal Buddika Meegahapola
Anthony Christopher Davison, Soumaya Elkantassi