Wayne Pullan
Griffith University
41 Papers
263 Citations
Wayne Pullan is an academic researcher from Griffith University. The author has contributed to research in topics: Local search (optimization) & Genetic algorithm. The author has an hindex of 15, co-authored 40 publications. Previous affiliations of Wayne Pullan include University of Colorado Boulder & Central Queensland University.
Chat about Author
Papers
Dynamic local search for the maximum clique problem
Wayne Pullan,Holger H. Hoos +1 more
TL;DR: It is shown empirically that DLSMC achieves substantial performance improvements over state-of-the-art algorithms for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.
Simple ingredients leading to very efficient heuristics for the maximum clique problem
TL;DR: The heuristics tested in this paper are basically parameter free: most of the DIMACS benchmark instances are solved within very short CPU times and a new putative optimum was discovered by one of the algorithms.
110
Approximating the maximum vertex/edge weighted clique using local search
TL;DR: This paper extends the recently introduced Phased Local Search (PLS) algorithm to more difficult maximum clique problems and also adapts the algorithm to handle maximum vertex/edge weighted clique instances.
97
Phased local search for the maximum clique problem
TL;DR: Phased Local Search has no problem instance dependent parameters and achieves state-of-the-art performance for the maximum clique problem over a large range of the commonly used DIMACS benchmark instances.
93
Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
TL;DR: This paper extends the recently introduced Phased Local Search (PLS) maximum clique algorithm to unweighted/weighted maximum independent set and minimum vertex cover problems.
61