Combinatorial optimisation, operational research, graph theory, algorithms

Outline

In this project you will learn about different methods for tackling combinatorial optimisation problems using both exact and approximate (heuristic) algorithms.

A number of interesting problems have recently been proposed in the literature that involve identifying groups of closely related people in social networks. This could be used, for example, to help identify community structures in or to predict people’s memberships of groups when this information is not available.

These sorts of problems take ideas from area like graph colouring, but are very different in their underlying structure. A PhD in this area would focus on some of these problems and would design and test various heuristic and metaheuristic algorithms for the problem. Upper and lower bounds may also be proposed, where appropriate.

Project aims and methods

There will be a heavy element of coding in these projects (most likely C++ or java) and you will become experienced in running large scale experiments and statistically analysing the results. You will also learn much in the area of combinatorial optimisation, which has applications in a multitude of industrial settings.

What is funded

Self-funded students only.

How to Apply

Applicants should submit an application for postgraduate study via the online application service: http://www.cardiff.ac.uk/study/postgraduate/research/programmes/programm...

In the research proposal section of your application, please specify the project title and supervisors of this project.

In the funding section, please select the ’self -funding’ option and specify the project title.

We are interested in pursuing this project and welcome applications if you are self-funded or have funding from other sources, including government sponsorships or your employer.