Department of Information Technology

The ASTRA Group on Combinatorial Optimisation

The ASTRA Group focuses on combinatorial (or: discrete) optimisation, which is about finding discrete values for unknowns such that constraints are satisfied and, optionally, a cost is (near-)minimal or a gain is (near-)maximal.

Applications of combinatorial optimisation include 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; etc.

News from the ASTRA Group

  • Mikael Östlund defends his MSc thesis on a sweep-based propagator for an n-dimensional no-overlap constraint in Gecode on 1 June 2017.
  • Pierre Flener lectures at the ACP Summer School 2017, to be held in Porquerolles (France) in September 2017.
  • Pierre Flener and Justin Pearson serve on the Programme Committee of CP 2017, to be held in Melbourne (Australia) in August 2017.
  • Andrius Vaicenavicius of the University of Oxford (UK) visited us from 22 to 23 May 2017 and gave a talk on local search.
  • The NordConsNet Workshop 2017 of the Nordic Network for researchers and practitioners of Constraint programming was organised by us on 22 May 2017 at Uppsala University.
  • Linnea Ingmar defended her BSc thesis on a compact-table propagator for the TABLE constraint in Gecode on 19 May 2017.

Updated  2017-05-23 19:36:07 by Pierre Flener.