Home > Search Results: keywords:"group problem"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
The Asymptotic Integer Algorithm
 Murinová, Michaela ; Kalčevová, Jana (advisor) ; Jablonský, Josef (referee)
This work is dealing with the tasks of integer programming and with the methods for their solving. The most famous methods are "branch and bounds method" and the Gomory's method of cut algorithms. The purpose of this work is to get readers acquainted with the alternative method of asymptotic integer algorithm. This method is based on the similar idea as the rounding procedure. The main idea is to enable the nonbasic variables gain a non-zero value. It leads to cutting the continuous (noninteger) solution space on the graphics illustration, while no integer solution should be lost. This method is presented on the example, which is a part of the main chapter and furthermore on its own example in the third chapter.
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