9 citations · 11 across the 6 of their papers we have counts for
6 papers
Minimal Conditions for Beneficial Local Search
Mark G Wallace
This paper investigates why it is beneficial, when solving a problem, to search in the neighbourhood of a current solution. The paper identifies properties of problems and neighbou…
The Neighbours' Similar Fitness Property for Local Search
Mark Wallace, Aldeida Aleti
For most practical optimisation problems local search outperforms random sampling - despite the "No Free Lunch Theorem". This paper introduces a property of search landscapes terme…
Is perturbation an effective restart strategy?
Aldeida Aleti, Mark Wallace, Markus Wagner
Premature convergence can be detrimental to the performance of search methods, which is why many search algorithms include restart strategies to deal with it. While it is common to…
Steepest ascent can be exponential in bounded treewidth problems
David A. Cohen, Martin C. Cooper, Artem Kaznatcheev +1
We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph of variabl…
Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs
Tim Dwyer, Christopher Mears, Kerri Morgan +3
Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbour…
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey +1
The technical report presents a generic exact solution approach for minimizing the project duration of the resource-constrained project scheduling problem with generalized preceden…