Index of /~pierref/courses/COCP/slides

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory   -  
[   ]eNegotiation.pdf 2018-09-04 14:15 1.8M 
[   ]T11-MIP.pdf 2018-09-26 15:05 130K 
[   ]T10-SAT-SMT.pdf 2018-09-26 15:03 185K 
[   ]T09-CBLS.pdf 2018-09-26 15:01 145K 
[   ]T08-InferenceSearchC..>2018-09-26 13:11 256K 
[   ]T07-SolvingTechs.pdf 2018-09-27 11:29 322K 
[   ]T06-CaseStudies.pdf 2018-09-26 16:19 1.0M 
[   ]T05-Symmetry.pdf 2018-09-17 08:32 464K 
[   ]T04-Modelling.pdf 2018-09-17 10:06 205K 
[   ]T03-ConsPredicates.pdf 2018-09-17 08:33 400K 
[   ]T02-BasicModelling.pdf 2018-09-25 10:03 227K 
[   ]T01-Introduction.pdf 2018-09-26 17:30 1.7M 
[TXT]README.txt 2018-05-30 10:40 1.2K 
[DIR]COCP-autumn17/ 2018-09-26 15:10 -  

This page has the slides of the courses "Combinatorial Optimisation
and Constraint Programming [COCP]" (10 ECTS credits, code 1DL441) and
"Modelling for Combinatorial Optimisation [M4CO]" (5 ECTS credits,
code 1DL451) by Prof. Pierre Flener at Uppsala University in Sweden.
The course is held every autumn semester.

--- The courses are being completely reorganised for autumn 2018, but
--- the slides of the last runs of the courses are temporarily
--- provided for reference.

The first half of the COCP course is the M4CO course and comprises the
first 11 topics: we use the MiniZinc language and toolchain
( in order to model various problems and run
the models under solvers of various technologies (CP, SAT, SMT, MIP,
local search, and hybrids thereof).

The second half of the COCP course comprises the last 7 topics: we
study the algorithms for a solver of constraint programming (CP)
technology and use the Gecode C++ library ( for
the assignments.

If you are an instructor and would like to use the LaTeX source of
these slides, then contact me (; under
additional conditions, I can also give you the source code of
assignment questions.