Registry
Module Specifications
Archived Version 2014 - 2015
| |||||||||||||||||||||||||||||||||||||
|
Description This module provides an introduction to combinatorial optimisation. In this module students will develop knowledge and skills in the basic combinatorial algorithms applied to optimisation. The participants are expected to have a good knowledge of linear algebra and experience with the abstract approach to mathematics. This module provides the first steps in the discipline known as operations research. Students are expected to attend lectures, participate in tutorials and take in-class tests. | |||||||||||||||||||||||||||||||||||||
|
Learning Outcomes 1. Apply algorithms in optimisation problems 2. Demonstrate a knowledge of the geometry underlying linear programming 3. Interpret algorithm output 4. Construct proofs of simple propositions | |||||||||||||||||||||||||||||||||||||
All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml |
|||||||||||||||||||||||||||||||||||||
|
Indicative Content and
Learning Activities GraphsGraphs, trees, shortest path algorithms, greedy algorithm, matroidsPolytopesPolytopes, Farkas' Lemma, linear programming, the geometry of linear inequalitiesMatchingsmatching problems, bipartite matching, weighted matchingNetwork flowmax-flow via simplex method, and via graph search | |||||||||||||||||||||||||||||||||||||
| |||||||||||||||||||||||||||||||||||||
Indicative Reading List
| |||||||||||||||||||||||||||||||||||||
|
Other Resources None | |||||||||||||||||||||||||||||||||||||
| Programme or List of Programmes | |||||||||||||||||||||||||||||||||||||
| Archives: |
| ||||||||||||||||||||||||||||||||||||