2025
Search and Optimisation
Name: Search and Optimisation
Code: INF13257M
6 ECTS
Duration: 15 weeks/156 hours
Scientific Area:
Informatics
Teaching languages: Portuguese
Languages of tutoring support: Portuguese
Sustainable Development Goals
Learning Goals
To acquire a global vision and understanding of combinatorial problem satisfaction and optimisation (CO)
To apply CO methods to actual problems, being able to assess the adequacy of different strategies to specific problems
To acquire knowledge and training which may lead to doing research in related areas
To apply CO methods to actual problems, being able to assess the adequacy of different strategies to specific problems
To acquire knowledge and training which may lead to doing research in related areas
Contents
State-graphs and the A* algorithm
Constraint Satisfaction Problems (CSP)
Constraint Solving Techniques
Constraint Programming
Combinatorial Optimization Problems (COP)
Local Search techniques
Metaheuristics
Applications
Constraint Satisfaction Problems (CSP)
Constraint Solving Techniques
Constraint Programming
Combinatorial Optimization Problems (COP)
Local Search techniques
Metaheuristics
Applications
Teaching Methods
The course takes the form of lectures and tutorials.
The teaching is application-driven, whenever possible and relies on the e-learning platform (Moodle, at this time).
Assessment consist in a significant group project and a set of in-class tests which take place during the semester. A final exam may replace the tests.
The teaching is application-driven, whenever possible and relies on the e-learning platform (Moodle, at this time).
Assessment consist in a significant group project and a set of in-class tests which take place during the semester. A final exam may replace the tests.
Assessment
Written assessment (2 tests or 1 exam) ~ 70%
Problem assignment ~ 30%
Problem assignment ~ 30%
Teaching Staff (2024/2025 )
- Salvador Luís de Bethencourt Pinto de Abreu [responsible]
Certificações
