Some tractable instances of interval data minmax regret problems
نویسندگان
چکیده
منابع مشابه
Some tractable instances of interval data minmax regret problems
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well known solvable instances. Tractable cases occur when the parameter is bounded by a constant.
متن کاملSome Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...
متن کاملSome tractable instances of interval data minmax regret problems: bounded distance from triviality (short version)
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particular instances of the interval data minmax regret versions of the shortest path, minimum spanning tree and weighted (bipartite) perfect matching problems. These sets are defined using a parameter that measures the distan...
متن کاملDiscrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain those all requirements when having much money? Why don't you try to get something simple at first? That's something that will lead you to know more about the world, adventure, some places, history, entertainment, and more? It is your own time to continue reading habit....
متن کاملA double oracle approach to minmax regret optimization problems with interval data
In this paper, we provide a generic anytime lower bounding procedure for minmax regret optimization problems. We show that the lower bound obtained is always at least as accurate as the lower bound recently proposed by Chassein and Goerigk [2]. The validity of the bound is based on game theoretic arguments and its computation is performed via a double oracle algorithm [6] that we specify. The l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2007.12.004