Till innehåll på sidan

Justin Pearson: The Essence of Constraint Programming

Constraint Programming (CP) is a relatively young paradigm, geared
towards the elegant modelling and efficient solving of combinatorial
problems, which are so ubiquitous and important in management,
engineering, and science. CP works in a way orthogonal and
complementary to other optimisation technologies, such as integer
programming (IP), Boolean satisfiability (SAT), and answer-set
programming (ASP). CP has become the technology of choice in some
areas, such as scheduling and configuration.

I will present the essential principles of CP and combinatorial
optimisation, and present some our research group's
(http://www.it.uu.se/research/group/optimisation research activities
within CP and optimisation.

Tid: Fr 2021-09-17 kl 11.00 - 12.00

Plats: 3418, https://www.kth.se/places/room/id/774d2e00-417d-4642-b644-f0c6b761e491

Språk: English

Medverkande: Justin Pearson (http://user.it.uu.se/~justin/), Uppsala University, Sweden

Join Zoom Meeting

Innehållsansvarig:Per Enqvist
Tillhör: Stockholms Matematikcentrum
Senast ändrad: 2021-09-14