Fast reoptimization of Steiner trees: Changing the Edge set
نویسندگان
چکیده
منابع مشابه
Fast reoptimization of Steiner trees: Changing the Edge set
In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occurs later on in the given graph. New optimal Steiner tree is to be determine, this process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge. For...
متن کاملReoptimization of Steiner trees: Changing the terminal set
Given an instance of the Steiner tree problem together with an optimal solution, we consider the scenario where this instance is modified locally by adding one of the vertices to the terminal set or removing one vertex from it. In this paper, we investigate the problem whether the knowledge of an optimal solution to the unaltered instance can help in solving the locally modified instance. Our r...
متن کاملReoptimization of TSP and Steiner Tree: Changing single edge-weights
We consider the following optimization problem: Given an instance of an optimization problem and some optimum solution for this instance, we want to find a good solution for a slightly modified instance. Additionally, the scenario is addressed where the solution for the original instance is not an arbitrary optimum solution, but is chosen among all optimum solutions in a most helpful way. In th...
متن کاملRobust Reoptimization of Steiner Trees
In reoptimization problems, one is given an optimal solution to a problem instance and a local modification of the instance. The goal is to obtain a solution for the modified instance. The additional information about the instance provided by the given solution plays a central role: we aim to use that information in order to obtain better solutions than we are able to compute from scratch. In t...
متن کاملThe Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
In this paper, we deal with several reoptimization variants of the Steiner tree problem in graphs obeying a sharpened β-triangle inequality. A reoptimization algorithm exploits the knowledge of an optimal solution to a problem instance for finding good solutions for a locally modified instance. We show that, in graphs satisfying a sharpened triangle inequality (and even in graphs where edge-cos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/517-834