Scribd
Upload
31 views2 pages

!GEDPUBLICREPORTS

This document provides information about the MATH-460 Combinatorial Optimization course offered in the 2017-2018 academic year. The course covers topics such as shortest path algorithms, minimum spanning trees, matchings, and approximation algorithms. It is taught through lectures and exercises, and assessed through a written exam. Prerequisites include a previous discrete optimization course. Upon completing the course, students should be able to solve combinatorial optimization problems, prove theorems, design algorithms, and analyze algorithm efficiency.

Uploaded by

Alejandro Espindola
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views2 pages

!GEDPUBLICREPORTS

This document provides information about the MATH-460 Combinatorial Optimization course offered in the 2017-2018 academic year. The course covers topics such as shortest path algorithms, minimum spanning trees, matchings, and approximation algorithms. It is taught through lectures and exercises, and assessed through a written exam. Prerequisites include a previous discrete optimization course. Upon completing the course, students should be able to solve combinatorial optimization problems, prove theorems, design algorithms, and analyze algorithm efficiency.

Uploaded by

Alejandro Espindola
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

2017-2018 COURSE BOOKLET

MATH-460 Combinatorial optimization

Cursus Sem. Type


Language English
Data Science MA1 Opt. Credits 5
Ing.-math MA1, MA3 Opt. Session Winter
Semester Fall
Mathématicien MA1, MA3 Opt.
Exam Written
Mathématiques pour l'enseignement MA1, MA3 Opt. Workload 150h
Weeks 14
Hours 4 weekly
Lecture 2 weekly
Exercises 2 weekly

Remarque
pas donné en 2017-18

Summary
The guiding question of Combinatorial Optimization is: How do I efficiently select an optimal solution among a finite but
very large set of alternatives? We will address the solution of this question in the context of classical discrete optimization
problems.

Content
• Paths and flows: Stronlgly polynomial time algorithms for shortest paths and minimum cost network flows
• Minimum spanning trees and matroids: Greedy, Kruskal's and Prim's algorithm
• Arborescences and matroid intersection
• Polyhedra and approximation algorithms
• Maximum weight matchings in general graphs and the matching polytope

Keywords
• Algorithm
• Polyhedron
• Matroid
• NP-completeness

Learning Prerequisites
Required courses
Discrete optimization (Second year math.)

Learning Outcomes
By the end of the course, the student must be able to:
• Choose an appropriate method for solving a combinatorial optimization problem
• Prove theorems in discrete optimization
• Design algorithms
• Analyze efficiency of algorithms

Combinatorial optimization Page 1 / 2


2017-2018 COURSE BOOKLET

Transversal skills
• Demonstrate a capacity for creativity.
• Continue to work through difficulties or initial failure to find optimal solutions.
• Assess one's own level of skill acquisition, and plan their on-going learning goals.

Teaching methods
Ex cathedra lecture and exercises to be solved at home and in the classroom

Expected student activities


Attendance of lectures and exercises
Completion of exercises at home
Study of literature

Assessment methods
Written exam during exam session

Supervision
Office hours Yes
Assistants Yes
Forum No

Resources
Bibliography
Alexander Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer-Verlag.

Combinatorial optimization Page 2 / 2

You might also like