The PhD program in Business Administration at DeGroote offers students the opportunity to study and conduct leading-edge research with some of the top researchers in their fields. Students develop the theoretical and methodological expertise required to create original research that makes a significant impact on the business community.

Start your application here   Start Today

Course Description

Combinatorial Optimization: Complexity and Heuristics

  • Prerequisite: Q773 or permission of the instructor

The first part of the course will focus on solvable network flow problems such as assignment, transportation, transshipment, shortest path, max flow and minimum spanning tree problems. Well known algorithms (such as Dijkstra, Bellman-Ford and Augmenting path algorithm) will be discussed as well as general methodology such as lifting procedures polyhedral theory (strong valid inequalities). The second part will focus on complexity theory and heuristic methods and covers NP-Completeness, Approximation algorithms, local and random search, and metaheuristics (such as Ant colony, genetic algorithms, simulated annealing and tabu search).  GAMS and a general purpose programming language (e.g., C, Matlab or Python) will be used in a computational project.

Course Offerings

Winter 2019

Code Section Outline
C01 Outline
DeGroote on LinkedIn DeGroote on Twitter DeGroote on Facebook