Index of /~pierref/courses/COCP/slides

[ICO]NameLast modifiedSizeDescription

[PARENTDIR]Parent Directory   -  
[   ]01-intro.pdf 2021-11-01 08:51 13M 
[   ]02-domains-variables..>2021-11-09 12:28 4.6M 
[   ]03-state-management-..>2021-11-15 08:15 4.5M 
[   ]04a-sum-constraint.pdf 2021-11-03 08:32 2.3M 
[   ]04b-element-constrai..>2021-11-15 08:15 4.8M 
[   ]05a-circuit.pdf 2021-11-09 08:34 1.4M 
[   ]05b-optim-lns.pdf 2021-11-08 09:05 1.3M 
[   ]06-alldifferent.pdf 2021-11-15 08:15 3.4M 
[   ]07-table-constraints..>2021-11-15 08:15 7.8M 
[   ]08-black-box-search.pdf2021-11-23 08:23 1.1M 
[   ]09-cumulative-schedu..>2021-11-23 08:23 3.6M 
[   ]10-disjunctive-sched..>2021-11-23 08:23 1.1M 
[TXT]README.txt 2022-08-05 10:05 1.3K 
[   ]T01-Introduction.pdf 2022-08-05 17:33 1.7M 
[   ]T02-BasicModelling.pdf 2022-08-05 10:06 269K 
[   ]T03-ConsPredicates.pdf 2022-08-05 10:17 433K 
[   ]T04-Modelling.pdf 2022-08-05 10:27 205K 
[   ]T05-Symmetry.pdf 2022-08-05 10:30 479K 
[   ]T06-CaseStudies.pdf 2022-08-05 10:34 1.0M 
[   ]T07-SolvingTechs.pdf 2022-08-05 10:39 332K 
[   ]T08-InferenceSearchC..>2022-08-05 10:50 272K 
[   ]T09-CBLS.pdf 2018-09-26 15:01 145K 
[   ]T10-SAT-SMT.pdf 2018-09-26 15:03 185K 
[   ]T11-MIP.pdf 2020-11-01 12:30 129K 
[   ]T12-CP-MiniCP.pdf 2021-10-28 13:59 282K 
[   ]T12a-CP-Gecode.pdf 2020-11-13 07:22 307K 
[   ]T12b-CP-Gecode.pdf 2018-10-24 12:39 657K 
[   ]T13-Consistency.pdf 2020-11-20 07:08 849K 
[   ]T14-Propagation.pdf 2020-11-06 07:13 366K 
[   ]T15-Search.pdf 2020-11-26 08:54 193K 
[   ]T16-Propagators.pdf 2021-10-20 13:31 490K 
[   ]T17-LocalSearch.pdf 2020-11-26 08:55 713K 
[   ]T18-Conclusion.pdf 2021-10-20 13:32 1.1M 
[TXT]changelog.txt 2022-08-05 11:17 29K 
[TXT]delta.txt 2021-10-29 09:47 1.6K 

This page has the slides of the courses "Combinatorial Optimisation
and Constraint Programming [COCP]" (10 ECTS credits, code 1DL442) 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 first half of the COCP course is the M4CO course and comprises the
first 11 topics (T01 to T11): we use the MiniZinc language and
toolchain (https://www.minizinc.org) in order to model various
problems and run the models under solvers of various technologies (CP,
SAT, MIP, local search, and hybrids thereof).

The second half of the COCP course is now based on, and contributes
to, the MiniCP teaching project (http://www.minicp.org), with files
T12-CP-MiniCP and T18-Conclusion added.  It used to comprise the last
7 topics (T12 to T18): we studied the algorithms for a solver of
constraint programming (CP) technology and used the Gecode C++ library
(https://www.gecode.org) for the assignments; those slides are
currently not maintained, but left here for archival purposes.

If you are an instructor and would like to use the LaTeX source of
these slides, then contact me (https://user.it.uu.se/~pierref); under
additional conditions, I can also give you the source code of
assignment questions.