Home > Search Results: keywords:"numerical algorithm"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Optimization of flow in graph
 Popovič, Viktor ; Lachout, Petr (advisor) ; Kozmík, Václav (referee)
When it comes to maximization of effectively or minimizing of cost, optimization represents the key activity. There is a number of practical examples that can be implemented into Theory of Graphs and subsequently optimized. This thesis includes the introduction to transportation problem where the consumer demand is met by the lowest price. Also there is maximum flow problem which is to transfer maximum of commodity (petroleum, gas...) through the network where each edge has a capacity restriction. We will also look into the alternative situations where we will maximize the flow along with minimizing of cost. To resolve these problems we will establish numeric algorithms like distribute method, labeling algorithm, shortest augmented path algorithm, and Preflow-Push algorithms. We will also illustrate functionality on example which confirm appropriate application of algorithms and differences among them.
Detailed record
BlakerCI: An algorithm and R package for the Blaker's binomial confidence limits calculation
 Klaschka, Jan
Fulltext: content.csg - Download fulltextPDF
Plný tet: v1099-10 - Download fulltextPDF
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English