The problem of finding a symmetric connectivity topology with minimum power consumption in a wireless ad-hoc network is NPhard. This work presents a new iterated local search to s...
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
—In this paper, the multiple trajectory search (MTS) is presented for large scale global optimization. The MTS uses multiple agents to search the solution space concurrently. Eac...
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...