Home > Search Results: keywords:"the interval multiobjective shortest path problem|the minimax regret problem|an efficient solution"
Search:
Search Tips :: Advanced Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.00 seconds. 
Multiobjective shortest path problem with interval costs
 Březina, Jiří ; Hladík, Milan (advisor) ; Fink, Jiří (referee)
The multiobjective shortest path problem with interval costs is a gener- alization of the single-pair shortest path problem. In this problem, the edge weights are represented as tuples of intervals. The aim is to find the path that minimizes the maximum regret. We present theorems regarding the compu- tation of the regret and the efficiency of a feasible solution to the problem. The main result of the thesis is an algorithm seeking for the solution with the least regret in the interval multiobjective shortest path problem. 1
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