Code: | CC330 | Acronym: | CC330 |
Keywords | |
---|---|
Classification | Keyword |
OFICIAL | Computer Science |
Active? | Yes |
Web Page: | http://www.dcc.fc.up.pt/~jpp/mad |
Responsible unit: | Department of Computer Science |
Course/CS Responsible: | Bachelor in Geology |
Acronym | No. of Students | Study Plan | Curricular Years | Credits UCN | Credits ECTS | Contact hours | Total Time |
---|---|---|---|---|---|---|---|
L:AST | 0 | Plano de Estudos a partir de 2008 | 3 | - | 5 | - | |
L:B | 0 | Plano de estudos a partir de 2008 | 3 | - | 5 | - | |
L:CC | 33 | Plano de estudos de 2008 até 2013/14 | 2 | - | 5 | - | |
3 | |||||||
L:F | 0 | Plano de estudos a partir de 2008 | 3 | - | 5 | - | |
L:G | 1 | P.E - estudantes com 1ª matricula anterior a 09/10 | 3 | - | 5 | - | |
P.E - estudantes com 1ª matricula em 09/10 | 3 | - | 5 | - | |||
L:M | 0 | Plano de estudos a partir de 2009 | 3 | - | 5 | - | |
L:Q | 0 | Plano de estudos Oficial | 3 | - | 5 | - | |
MI:ERS | 9 | Plano de Estudos a partir de 2007 | 3 | - | 5 | - |
Students should:
- get familiar with techniques of operations research and constraint programming
and their application to modeling and solving deterministic and stochastic decision and optimization problems.
- develop skills for understanding computational complexity of concrete problems, and choosing algorithms, programming languages and libraries/APIs for solving them.
Master the main techniques in optimization and simulation.
Formulation of formal models for decision problems.
Linear Programming: the Simplex method; transportation and assignment problems. Network problems: shortest and longest paths, spanning trees, max flow, project management (Critical Path Method).
Introduction to Integer Programming and Combinatorial Optimization.
Methods and techniques for reducing the search space: dynamic programming, constraint propagation, local consistency enforcement, branch-and-bound, cutting planes, symmetry breaking, model reformulation, approximation algorithms (greedy strategies) and local search.
Constraint (Logic) Programming languages and systems.
Introduction Markov Chains and queueing theory.
Lectures: Exposition of the program topics and discussion of examples using a computer connected to a multimedia projector.
Labs: problem solving and case studies with experimental evaluation.
designation | Weight (%) |
---|---|
Defesa pública de dissertação, de relatório de projeto ou estágio, ou de tese | 25,00 |
Exame | 75,00 |
Total: | 100,00 |
designation | Time (hours) |
---|---|
Elaboração de relatório/dissertação/tese | 25,00 |
Estudo autónomo | 50,00 |
Frequência das aulas | 50,00 |
Total: | 125,00 |
Students cannot exceed the absence limit (25% of total number of estimated lab classes)
Lab Assignment (25%).
Written examination (75%).
A minimum grade of 9.5 at 20 is required in the final exam.
The same evaluation criteria for all students.
Lab Assignment grade cannot be improved.