Course AMI23C

Complexity and Operations Research Methods

7.5 Credits
Second Cycle

Starts week 4, 2025

The course will give a firm understanding of tractable problems and how to empirically estimate the computational resources (storage and time) required by an algorithm. Classic algorithms such as simplex method and big M method will be introduced to solve tractable problems. In addition, intractable problems such as integer programming problems are also introduced. The students will explore how classical solution methods such as linear programming and dynamic programming break down in intractable cases. The course will introduce advanced algorithms to solve intractable problems. Students study alternative solution methods such as stochastic and heuristic approximation methods such as tabu search, branch and bound, relaxation, genetic algorithms and simulated annealing.
Starts and ends:
week 4, 2025 - week 13, 2025
Study Rate:
Time of Day:
Teaching form:
P: Course only offered as part of programme.
Entry Qualifications :
  • 30 credits second level within the Mainfield of Microdata Analysis
Selection :
Guarenteed admission
Application Code:
Main field of study:
Tuition Fee
First Tuition Fee Installment:
16,875 SEK
Total Tuition Fee:
16,875 SEK
EU/EEA Citizens or exchange students are not required to pay fees.
Information on application and tuition fees:
Application period
Literature List

Literature lists are published at the latest one month ahead of the course start date.

To Literature List
How may we help you?

Ask us about studying at Dalarna University.
+46 23-77 88 88

Course Coordinator
Mengjie Han