Combinatorial Optimization (P00699)

? Credit Points : 5 ? SCQF Level : 11 ? Acronym : MAT-P-CO

This module will address both optimal and heuristic approaches - cutting plane, branch-and-bound, branch-and-cut, Lagrangian relaxation, local search, simulated annealing, tabu search, genetic algorithms, and neural networks - to solving combinatorial optimization problems such as production planning and scheduling, operational management of distribution systems, timetabling, location and layout of facilities, routing and scheduling of vehicles and crews, etc.

Entry Requirements

? Pre-requisites : PGs only

Subject Areas

Home subject area

Operational Research, (School of Mathematics, Schedule P)

Delivery Information

? Normal year taken : Postgraduate

? Delivery Period : Block 3 only

? Contact Teaching Time : 10 hour(s) per week for 1 weeks

Summary of Intended Learning Outcomes

Ability to formulate a wide range of management problems that can be solved to optimality by classical combinatorial optimization techniques and the knowledge of alternative solution approaches such as metaheuristics that can find nearly optimal solutions. Awareness how difficult some practical optimization problems can be and the complex role performed by managers.