Coordinator and main point of contact: Professor Adam N. Letchford, Lancaster University.
Lancaster University:
- Professor Adam N. Letchford: cutting-plane methods for combinatorial and global optimisation, especially vehicle routing problems and problems with quadratic aspects.
- Dr Konstantinos (Dinos) Kaparis: exact and heuristic methods for combinatorial optimisation.
Nottingham University:
- Dr Andrew Parkes: meta-heuristics, hyper-heuristics, proof systems.
- Jakub Marecek: integer programming, graph colouring.
Cardiff University:
- Dr Iskander Aliev: algebraic/geometric methods for discrete optimisation problems.
Southampton University:
- Dr Tolga Bektas: integer programming (especially decomposition, relaxation, branch-and-cut); logistics and network design.
- Professor Joerg Fliege: nonlinear optimisation, fast local search algorithms, multiobjective optimisation, distributed computing.
- Banafsheh Khosravi: metaheuristics; lot sizing, railway scheduling, disruption management.
- Mohammad Mesgarpour: simulated annealing; machinescheduling, aircraft runway optimization.
- Professor Chris Potts: combinatorial optimisation (especially branch-and-bound, local search, approximation algorithms); machine scheduling.
- Dr Houduo Qi: semi-definite programming: theory and algorithms.
- Dr Huifu Xu: non-linear programming and applications.
- Dr Yue Wu: non-linear programming (especially non-convex conic problems); logistics and supply chain management.
