Subject description - AD7B35OIS

Summary of Study | Summary of Branches | All Subject Groups | All Subjects | List of Roles | Explanatory Notes               Instructions
AD7B35OIS Optimization in Intelligent Systems
Roles:  Extent of teaching:14KP+6KC
Department:13135 Language of teaching:CS
Guarantors:  Completion:Z,ZK
Lecturers:  Credits:6
Tutors:  Semester:L

Anotation:

The goal is to show the algorithms for several combinatorial optimization problems. Following the subject on algorithms, we show optimisation techniques based on graphs, integer linear programming, heuristics, approximation algorithms and state space search methods. We focus on application of optimization in stores, ground transport, flight transport, logistics, planning of human resources, scheduling in production lines, message routing, scheduling in parallel computers.

Course outlines:

1. Example Applications and Formulation of Problems.
2. Basic Terms of Graph Theory.
3. Spanning Trees.
4. Network Flows.
5. Linear Programming.
6. Algorithms for Linear Programming. Test I.
7. Time Complexity of Algorithms.
8. Branch and Bound Technique and its Applications
9. Metaheuristics and Approximation Algorithms.
10. Scheduling on Monoprocessor
11. Scheduling on Parallel Processors
12. The Job Shop Problem
13. Reserve.

Exercises outline:

1. Introduction to the Scheduling Toolbox.
2. Properties of Graphs.
3. Spanning Tree and Clustering.
4. Individual Projects - Topics.
5. Applications of Network Flows
6. Linear Programming
7. Scheduling and Branch and Bound Technique
8. Approximation Algorithms and the SAT Problem
9. Individual Projects - Defense of the Programs
10. Test II.
11. Individual Projects - Defense.
12. Assessment.
13. Reserve.

Literature:

Main textbook
[1] B. H. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms. Springer, third ed., 2006.
Some parts of:
[2] J. Demel, Grafy a jejich aplikace. Academia, second ed., 2002.
[3] J. Blazevicz, Scheduling Computer and Manufacturing Processes. Springer, second ed., 2001.

Requirements:

Linear algebra Agorithmisation

Subject is included into these academic programs:

Program Branch Role Recommended semester

Page updated 18.4.2024 17:51:04, semester: L/2023-4, Z/2024-5, Z/2023-4, Send comments about the content to the Administrators of the Academic Programs Proposal and Realization: I. Halaška (K336), J. Novák (K336)
Responsible person: prof. Ing. Jiří Jakovenko, Ph.D.