|Website:||website containing additional information|
|Credits:||7.5 ECTS (=5.25 old credit points)|
|Period:||periode 1 (week 36 t/m 46, dwz 2-9-2004 t/m 12-11-2004; herkansing week 52)
|Participants:||up till now 13 subscriptions|
|Schedule:||Dit is een oud rooster!
|Contents:||Systems and programs are designed for many purposes and in many ways but it's
algorithms that make things work. Good algorithm design requires understanding
and modelling an application, and subsequently studying and analyzing the
computational features of the design. In this course we study a number of
advanced techniques for efficient algorithm design using cases in network
modelling, vehicle routing, integer linear programming,
logic modellling and effective approaches using randomization. The required
basics from the theory of NP-completeness will be re-appraised as well.
|Literature:||No required literature. The scribe notes document the material.|
|Course form:||The course consists of the following parts: the lectures, a research assignment,
one or more scribe-tasks, and a final exam. The course will be taught in English,
unless all participants are fluent in Dutch. For more information, see the `website with extra
|Exam form:||The information is given on the `website with extra information'. Participation and
attendence will count for 10 percent. The research assignment, the scribe task,
and the final exam will each count for 30 percent.|
|Minimum effort to qualify for 2nd chance exam:||Om aan de aanvullende toets te mogen meedoen is ontbreken van ten hoogte 1 toetsactiviteit toegestaan.|
|Description:||Algorithmic modeling as a general concern, is part of the system development
life cycle. In the course we set out from this general viewpoint and analyse
a variety of instances where algorithmic modeling is required. In the research
assignments, new topics will be analysed and elaborated for classroom presentation.
Note the prerequisites for the course. If you have not completed most of your
first three (BSc-)years, see your MSc-advisor, as you may not be admissible to
this course. Specific background required: datastructures, beginning algorithms,
and an acquantance with linear programming (as in `discrete optimalisering').