A NEW METHOD FINDING THE K-TH BEST PATH IN A GRAPH
نویسندگان
چکیده
منابع مشابه
A New Method Finding the K - Th Best Path in a Graph
This paper presents a new algorithm determining the K·th best path without any circuit between two specified vertices in a connected, simple and nonoriented graph.. The method presented here is based on the well·known fact that the minimum set of ring sum of several Euler graphs and a special path between two vertices consists of all paths between the vertices. Lastly, an illustrative example i...
متن کاملFinding Best k Policies
An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k best policies problem. The problem is to find the k best policies. The k best policies, k > 1, cannot be found directly using dynamic programming. Näıvely, finding the k-th best policy can be Turing reduced to the optimal planni...
متن کاملBest Proximity Point Result for New Type of Contractions in Metric Spaces with a Graph
In this paper, we introduce a new type of graph contraction using a special class of functions and give a best proximity point theorem for this contraction in complete metric spaces endowed with a graph under two different conditions. We then support our main theorem by a non-trivial example and give some consequences of best proximity point of it for usual graphs.
متن کاملAddressing Network Survivability Issues by Finding the K-Best Paths through a Trellis Graph
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (such as voice, data, and video) across high speed communication networks, it is becoming important for a network to offer survivability, or at least graceful degradation, in the event of network failure. In this paper we aim to offer a solution in the selection of the K-best dis...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1978
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.21.469