The Optimisation Group
The Optimisation Group focuses on solving optimisation problems, which is about finding values for unknowns such that constraints are satisfied and a cost is (near-)minimal or a gain is (near-)maximal. Sometimes the goal is to satisfy the constraints without a specific function to be minimised or maximised.
Our research is on methods and tools for mathematical programming, constraint programming, and local search. Applications of optimisation arise in many real-world domains, such as communication networks, transportation and logistics for resource allocation, personnel rostering under work regulations and employee preferences, scheduling under precedence and resource allocation constraints, vehicle routing under time windows for deliveries or pick-ups, routing and scheduling of data flows in information networks, planning and performance engineering of mobile communications systems, etc.
The optimisation group is coordinating the research arena of Applied Optimisation at the Department of Information Technology. The research arena is a networking effort at the department level, aiming at bringing together researchers for which optimisation is relevant for a wide range of application domains.
News from the Optimisation Group
- Jip J. Dekker of Monash University (Australia) visited us on 14 September 2018.
- Barnaby Martin of Durham University (United Kingdom) visited us from 10 to 14 September 2018.
- Our fzn-oscar-cbls backend for the MiniZinc constraint-based modelling language won a bronze medal at the MiniZinc Challenge 2018.
- Mats Carlsson, Pierre Flener, and Justin Pearson served on the Programme Committee of CP 2018, held in Lille (France) in late August 2018.
- David Escher defended his MSc thesis on the pre-runtime scheduling of an avionics system on 15 June 2018.
- The NordConsNet Workshop 2018 of the Nordic Network for researchers and practitioners of Constraint programming took place on 29 May 2018 at Jeppesen in Gothenburg, Sweden.