A hybrid of inference and local search for distributed combinatorial optimization
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.
- View record in Web of Science
Record created on 2012-07-04, modified on 2016-08-09