Combinatorial Optimization - Period 4+5

Computer Science Program
Amsterdam, Netherlands

Dates: 2/1/24 - 6/1/24

Computer Science

Combinatorial Optimization - Period 4+5

Combinatorial Optimization - Period 4+5 Course Overview

OVERVIEW

CEA CAPA Partner Institution: Vrije Universiteit Amsterdam
Location: Amsterdam, Netherlands
Primary Subject Area: Mathematics
Instruction in: English
Course Code: X_401067
Transcript Source: Partner Institution
Course Details: Level 300
Recommended Semester Credits: 3
Contact Hours: 84
Prerequisites: Operations Research (X_400618).

DESCRIPTION

In this course you will learn about the theory of combinatorial optimization problems. Also, you will apply the theory to model and solve complex problems using the available software. In particular, we consider performance measures for algorithms for combinatorial problems such as the running time and the quality of solutions.
Objectives:
- To obtain knowledge on the theory of combinatorial optimization
- To apply the theory to specific optimization problems. For example, by analyzing the running time or performance guarantee of a given algorithm or by constructing an own algorithm.
- To model problems (for example by integer linear programming) and to solve them using optimization software.

Contact hours listed under a course description may vary due to the combination of lecture-based and independent work required for each course therefore, CEA's recommended credits are based on the ECTS credits assigned by VU Amsterdam. 1 ECTS equals 28 contact hours assigned by VU Amsterdam.


Get a Flight Credit worth up to $500 when you apply with code* by January 1, 2025