J. Wesley Barnes

Learn More
When joined to a stipulated neighborhood digraph, an objective function deÞned on the solution space of a real combinatorial optimization problem forms a landscape. Grover shows that landscapes satisfying a certain difference equation have properties favorable to local search. Studying only symmetric and regular neighborhood digraphs, Stadler deÞnes(More)
Neighborhood specification is a dominant consideration in assuring the success of a direct search approach to a difficult combinatorial optimization problem. Previous research has shown the efficacy of imposing an elementary landscape upon the search topology. A theory of elementary landscapes, Applied Mathematics Letters 16 (2003)] generalize the notion of(More)