Module Specification
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.
1. Module Title NETWORKS IN THEORY AND PRACTICE
2. Module Code MATH367
3. Year Session 2023-24
4. Originating Department Mathematical Sciences
5. Faculty Fac of Science & Engineering
6. Semester Second Semester
7. CATS Level Level 6 FHEQ
8. CATS Value 15
9. Member of staff with responsibility for the module
Dr P Buividovich Mathematical Sciences Pavel.Buividovich@liverpool.ac.uk
10. Module Moderator
11. Other Contributing Departments  
12. Other Staff Teaching on this Module
Dr PEL Rakow Mathematical Sciences Rakow@liverpool.ac.uk
13. Board of Studies
14. Mode of Delivery
15. Location Main Liverpool City Campus
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
16. Study Hours 24

   24

       48
17.

Private Study

 102
18.

TOTAL HOURS

 150
 
    Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other
19. Timetable (if known)            
 
20. Pre-requisites before taking this module (other modules and/or general educational/academic requirements):

 
21. Modules for which this module is a pre-requisite:

 
22. Co-requisite modules:

 
23. Linked Modules:

 
24. Programme(s) (including Year of Study) to which this module is available on a mandatory basis:
25. Programme(s) (including Year of Study) to which this module is available on a required basis:
26. Programme(s) (including Year of Study) to which this module is available on an optional basis:
27. 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.
 
28. Learning Outcomes
 

(LO1) After completing the module students should be able to model problems in terms of networks and be able to apply effectively a range of exact and heuristic optimisation techniques.
 
29. Teaching and Learning Strategies
 

Material is provided in advance of classes for students to study asynchronously. The contact hours consist of one 2-hour active learning session and one 2-hour supported study/drop-in session.
 
30. Syllabus
   

Basic graph and network definitions and results. Minimal spanningtrees.

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, generalisedassignments.

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

Heuristics, local search methods, vehicle routing problem.
 
31. Recommended Texts
  Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
 

Assessment
32. EXAM Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
  formal examination 120 50
33. CONTINUOUS Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
  self-paced quizzes on CANVAS 0 20
  class test 60 30