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...
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
This paper deals with the design of improved construction heuristics and iterated local search for the Routing and Wavelength Assignment problem (RWA). Given a physical network and...
Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke,...
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...