Problem Solving

This course aims to demonstrate how real-life problems can be solved, such as gate allocation for airplanes, constrained pathfinding, etc. Various types of methods will be presented, such as greedy algorithms, local search, and constraint programming.

Ce cours présente différents types de méthodes afin de formaliser et résoudre des problèmes fortement combinatoires.

Calendrier

Content

This course is divided into 4 main parts:

1. Modelization
2. Greedy Algorithms
3. Local Search
4. Constraint Programming

The course slides will be updated as the course progresses.

• Introduction ; 4 slides per page ; 2 slides per page + notes
• Modelization ; 4 slides per page ; 2 slides per page + notes
• Greedy Algorithms ; 4 slides per page ; 2 slides per page + notes
• Local Search ; 4 slides per page ; 2 slides per page + notes
• Constraint Programming ; 4 slides per page ; 2 slides per page + notes

Hashcode

2018

• Greedy Algorithms ; 4 slides per page ; 2 slides per page + notes
• Local Search ; 4 slides per page ; 2 slides per page + notes
• Widget – HASHCODE2018

Previous Years’ Content

• 2018 Test
• 2019 Test
• 2018 Exam
• 2019 Exam

Assessment Methods

• Tests: at least 1 test.
• Final written exam of 2 hours, counting for 60% of the grade.
• Second session: 1h30 written exam.