Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Browsing by Subject Search problems
Showing results 1 to 6 of 6
| Issue Date | Title | Author(s) |
|---|---|---|
| 2009 | A clustering particle swarm optimizer for dynamic optimization | Li, C; Yang, S |
| 2007 | Continuous dynamic problem generators for evolutionary algorithms | Tinos, R; Yang, S |
| 2004 | A hybrid algorithm for k-medoid clustering of large data sets | Liu, X; Sheng, W |
| 2010 | A hybrid genetic algorithm and inver over approach for the travelling salesman problem | Arshad, S; Yang, S |
| 2003 | Reformulating software engineering as a search problem | Clark, JA; Dolado, JJ; Harman, M; Hierons, RM; Jones, BE; Lumkin, M; Mitchell, B; Mancoridis, S; Rees, K; Roper, M; Shepperd, MJ |
| 2014 | A test problem for visual investigation of high-dimensional multi-objective search | Li, M; Yang, S; Liu, X |