Combinatorial Optimization


This course focus on the algorithmic solution of network optimization problems and on the modeling using integer programming.

Objectives

not available

Prerequisites

not available

Syllabus

The shortest path problem, the minimum spanning tree problem, the maximum flow problem, and the minimum cost network flow problem. Furthermore, the student will be introduced to modelling and solution techniques for integer programming problems, branch & bound algorithm, dynamic programming, and special problems such as the Steiner tree problem and the traveling salesman problem (TSP). The student, apart from the methodology in each section, will learn how to use state-of-the-art optimization software packages such as the CPLEX & Gurobi solvers and the modelling language AMPL.

COURSE DETAILS

Level:

Type:

Undergraduate

(A+)

Instructors: Angelo Sifaleras
Department: Applied Informatics
Institution: University of Macedonia
Subject: Computer Science, Information Technology, Telecommunications
Rights: Attribution - ShareAlike CC BY-SA

Visit Course Page

SHARE THIS COURSE
RELATED COURSES

Ioannis Hatzilygeroudis
University of Patras
Department of Computer Enginnering & Informatics

Christos Bouras
University of Patras
Computer Engineering & Informatics Department

IOANNIS HATZILYGEROUDIS
University of Patras
COMPUTER ENGINEERING AND INFORMATICS DEPARTMENT

Nikolaos Tselios
University of Patras
Department of Educational Science and Early Childhood Education

John Garofalakis
University of Patras
Computer Engineering and Informatics Department

Paul Klepetsanis
University of Patras
Pharmacy

espa en
GUnet

© Copyright 2016 - GUnet