2017/18 Undergraduate Module Catalogue

COMP3910 Combinatorial Optimisation

10 creditsClass Size: 75

Module manager: Dr Natasha Shakhlevich
Email: N.Shakhlevich@leeds.ac.uk

Taught: Semester 2 (Jan to Jun) View Timetable

Year running 2017/18

Pre-requisite qualifications

One of the pre-requisite modules must be studied.

Pre-requisites

COMP2421	Numerical Computation
COMP2711	Algorithms I
COMP2941	Algorithms II
MATH2210	Introduction to Discrete Mathematics
MATH2640	Introduction to Optimisation

This module is not approved as a discovery module

Module summary

Solutions to many real world problems that arise in domains such as transport, manufacturing, supply chain management, telecommunications, financial decision making, healthcare logistics, planning and scheduling, can be obtained using techniques from the field of combinatorial optimisation. Combinatorial optimisation provides advanced analytical methods for decision making, where a set of feasible solutions is discrete and the task is to find the best one, with respect to some criteria. It is a well-established discipline with a powerful tool-kit that can be applied to solve real-world problems.In this module, we practice in formulating mathematical models using the techniques of linear programming and integer linear programming, learn how to distinguish between 'good' and 'bad' formulations and how the problems can be solved. One of the methods we study, the simplex method, is recognised as one of the 10 most influential algorithms of the 20th century.

Objectives

This module develops abstract modelling and problem solving skills and contributes to developing computer science professionals who are capable of handling real world problems using advanced analytical methods.

Learning outcomes
On successful completion of this module a student will have demonstrated the ability to:

- apply integer linear programming techniques to model combinatorial optimisation problems.

- select and apply appropriate methods for solving a combinatorial optimisation problem to find exact or heuristic solutions.

- articulate key concepts from the topic in a clear and rigorous manner.

Syllabus

This module covers the following 5 topic areas:

- Linear programming - simplex method, duality and the dual simplex method.

- Integer Linear Programming - modelling of combinatorial optimisation problems and logical conditions.

- Branch and bound algorithm - general methodology and implementation details.

- Network simplex algorithm - for minimum cost flows.

- Other solution approaches - construction and improvement heuristics.

Teaching methods

Delivery type	Number	Length hours	Student hours
Example Class	10	1.00	10.00
Consultation	11	1.00	11.00
Lectures	22	1.00	22.00
Private study hours			57.00
Total Contact hours			43.00
Total hours (100hr per 10 credits)			100.00

Private study

Taught session preparation: 18 hours
Taught session follow-up: 18 hours
Self-directed study: 7 hours
assessment activities: 25 hours

Opportunities for Formative Feedback

Coursework

Methods of assessment

Coursework

Assessment type	Notes	% of formal assessment
Problem Sheet	Problem Sheet 1	10.00
Problem Sheet	Problem Sheet 2	0.00
Problem Sheet	Problem Sheet 3	10.00
Problem Sheet	Problem sheet 4	0.00
Total percentage (Assessment Coursework)		20.00

This module is re-assessed by exam only.

Exams

Exam type	Exam duration	% of formal assessment
Standard exam (closed essays, MCQs etc)	2 hr 00 mins	80.00
Total percentage (Assessment Exams)		80.00

This module is re-assessed by exam only.

Reading list

The reading list is available from the Library website

Last updated: 26/04/2017

Disclaimer

Browse Other Catalogues

• Undergraduate module catalogue
• Taught Postgraduate module catalogue
• Undergraduate programme catalogue
• Taught Postgraduate programme catalogue

Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD