Skip to main content
Department of Information Technology

Research on Optimisation

Our research is concerned with both the theory and the practice of optimisation.

The modern tools and methods of optimisation are unfortunately mostly unknown outside computing departments, so that many opportunities for better solutions and/or shorter solving times are wasted, especially by the widespread mistaken belief that (NP-)hard problems cannot be solved at all or can at best only be tackled by greedy algorithms or by other sub-optimal algorithms.

Basic Research

On the theoretical side, we address the following research issues:

  • Global Constraints: specification and synthesis; reification; AUTOMATON, CUMULATIVE, and TREE constraints
  • Constraint-Based Local Search: MiniZinc back-end; set variables and set constraints; specification of constraints via automata and monadic existential second-order logic; neighbourhood design; massive instance data
  • Constraint-Based Modelling: string variables and constraints; relation variables; symmetry; the constraint-based modelling language ESRA
  • Solution characterisation of optimality analysis for optimal scheduling defined over a (arbitrary) service rate region

Applied Research

On the practical side, we apply optimisation in hard real-world tasks:

  • Air Traffic Management, with the European Organisation for the Safety of Air Navigation (EuroControl): airspace sectorisation; contingency planning; air-traffic complexity resolution in multi-sector planning
Updated  2022-04-19 10:33:35 by Pierre Flener.