Maksimālās plūsmas problēma un tās risināšanas metodes
Loading...
Date
Authors
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Latvijas Universitāte
Language
N/A
Abstract
Darbs ir veltīts maksimālās plūsmas problēmai un tās risināšanas metodēm.
Darbs satur grafa teorijas pamatjēdzienus, maksimālās plūsmas problēmas nostādni, ekvivalentaineārās programmēšanas uzdevuma aprakstu un analīzi, Forda- Fulkersona teorēmu un divus maksimālās plūsmas problēmas risināšanas algoritmus.
Darbā tiek veikta algoritmu salīdzināšana.
Visi jēdzieni un rezultāti ir ilustrēti ar piemēriem.
Pielikumā pievienoti uzdevumi studentu individuālam darbam.
The Paper is devoted to the maximum flow problem and its solution methods. This work contains basic concepts of graph theory, formulation of the problem of maximal flow, the analysis and description of equivalent linear programming problem, the theorem of Ford- Fulkerson and two solution algorithms of problem of maximal flow. A comparison of algorithms is carried out in the Paper. All concepts and results are illustrated with examples. Tasks for an individual work of students are added.
The Paper is devoted to the maximum flow problem and its solution methods. This work contains basic concepts of graph theory, formulation of the problem of maximal flow, the analysis and description of equivalent linear programming problem, the theorem of Ford- Fulkerson and two solution algorithms of problem of maximal flow. A comparison of algorithms is carried out in the Paper. All concepts and results are illustrated with examples. Tasks for an individual work of students are added.