Next Generation Optimization
I lead Data61's
Decision Sciences research group project in
We are developing the next generation of discrete optimization technology:
- High level modelling language
allows concise and powerful modelling of problems, and solving of the same model by many
solvers: constraint programming, mixed integer programming, SAT, SMT and local search.
- Powerful solving technology
lazy clause generation provides the state-of-the-art constraint programming solvers, and unbeatable results on many problems, particularly scheduling.
- Nested constraint programming: an extension to CP to allow the expression and solving of complex nested discrete optimization problems, such as
minimax problems, stochastic optimization problems, bi-level and multi-level optimization, quantified constraint optimization problems, and more.
This page, its contents and style, are the responsibility of the
author and do not necessarily represent the view, policies or opinions
of The University of Melbourne.
Except the last sentence which is
included only because it is the policy of The University of Melbourne.
Created: 19 June 1995 Maintainer: Peter Stuckey,
Last modified 12th August 2019