Module Details

The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title NETWORKS IN THEORY AND PRACTICE
Code MATH367
Coordinator Dr A Pantelous
Mathematical Sciences
A.Pantelous@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2016-17 Level 6 FHEQ First Semester 15

Aims

To develop an appreciation of network models for real world problems.

To describe optimisation methods to solve them.

To study a range of classical problems and techniques related to network models.


Learning Outcomes

After completing the module students should

 .      be able to model problems in terms of networks.

·      be able to apply effectively a range of exact and heuristic optimisation techniques.


Syllabus

1

Basic graph and network definitions and results.  Minimal  spanning trees.

Shortest/path algorithms (Dijkstra, Floyd).

Edge routing, Euler tours,Chinese postman problem.

Node routing, Hamilton tours,.Travelling salesman problem.

Complexity  problems.

Branch and bound strategies, integer linear programming, generalised assignments.

Lagrangean relaxation methods, knapsack problems, set-covering problems.

Heuristics, local search methods, vehicle routing  problem.


Recommended Texts

Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
Explanation of Reading List:

Pre-requisites before taking this module (other modules and/or general educational/academic requirements):

 

Co-requisite modules:

 

Modules for which this module is a pre-requisite:

 

Programme(s) (including Year of Study) to which this module is available on a required basis:

Programme:G1N2 Year:3

Programme(s) (including Year of Study) to which this module is available on an optional basis:

Programme:G100 Year:3 Programme:G101 Year:3,4 Programme:G110 Year:3 Programme:G1F7 Year:3 Programme:G1R9 Year:3 Programme:G1X3 Year:3 Programme:GG13 Year:3 Programme:GN11 Year:3 Programme:GG14 Year:3 Programme:GL11 Year:3 Programme:GR11 Year:3 Programme:GV15 Year:3 Programme:GG1A Year:3 Programme:BCG0 Year:3 Programme:L000 Year:3 Programme:Y001 Year:3 Programme:MMAS Year:1 Programme:G1N3 Year:3 Programme:NG31 Year:3

Assessment

EXAM Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
Written Exam  2.5 hours  First semester  100  No reassessment opportunity  Standard UoL penalty applies  Assessment 1 There is no reassessment opportunity, Notes (applying to all assessments) Final exam rubric: Full marks will be awarded for complete answers to all questions  
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes