LINFO2266: Advanced Algorithms for Optimization

• 1. Organization
  • 1.1. Pedagogy
  • 1.2. Evalutation
  • 1.3. Collaboration rules and AI usage policy
  • 1.4. Tools
  • 1.5. Projects and submissions
  • 1.6. Contact and communication
• 2. Dynamic Programming
  • 2.1. Theory
  • 2.2. Project: Dynamic Programming
• 3. Benchmarking and Comparing Optimization Algorihtms
  • 3.1. Theory
• 4. Branch and Bound
  • 4.1. Theory
  • 4.2. Project: Branch and Bound, Lagrangian Relaxation
• 5. Lagrangian Relaxation
  • 5.1. Theory
• 6. Linear Programming
  • 6.1. Theory
  • 6.2. Project: Linear Programming and Maximum-Flows
• 7. Network Flows
  • 7.1. Theory
• 8. Local Search
  • 8.1. Theory
  • 8.2. Project : TSP with Local Search
• 9. CP
  • 9.1. Theory
  • 9.2. Project : Constraint Programming
• 10. DP with A* based search
  • 10.1. Theory
  • 10.2. Project : A*
• 11. Competition
  • 11.1. Theory