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 Combinatorial optimization
Showing results 1 to 9 of 9
Issue Date | Title | Author(s) |
2008 | The development and application of metaheuristics for problems in graph theory: A computational study | Consoli, Sergio |
2008 | Discrete Particle Swarm Optimization for the minimum labelling Steiner tree problem | Consoli, S; Moreno-Pérez, J A; Darby-Dowman, K; Mladenović, N |
2009 | Discrete particle swarm optimization for the minimum labelling Steiner tree problem | Consoli, S; Moreno-Pérez, JA; Darby-Dowman, K; Mladenović, N |
2016 | Global supply chain optimization: a machine learning perspective to improve caterpillar's logistics operations | Veluscek, Marco |
2011 | A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem | Jat, SN; Yang, S |
2007 | Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem | Consoli, S; Darby-Dowman, K; Mladenović, N; Moreno-Pérez, JA |
2000 | An interior point algorithm for minimum sum-of-squares clustering | Du Merle, O; Hansen, P; Jaumard, B; Mladenović, N |
2007 | Solving the minimum labelling spanning tree problem using hybrid local search | Consoli, S; Darby-Dowman, K; Mladenović, N; Moreno-Perez, J A |
2007 | Variable neighbourhood search for the minimum labelling Steiner tree problem | Consoli, S; Darby-Dowman, K; Mladenović, N; Moreno Perez, J A |