Approximation of min–max and min–max regret versions of some combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90’s and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust d...
متن کاملA Probabilistic Model for Minmax Regret in Combinatorial Optimization
In this paper, we propose a probabilistic model for minimizing the anticipated regret in combinatorial optimization problems with distributional uncertainty in the objective coefficients. The interval uncertainty representation of data is supplemented with information on the marginal distributions. As a decision criterion, we minimize the worst-case conditional value-at-risk of regret. The prop...
متن کاملRandomized Minmax Regret for Combinatorial Optimization Under Uncertainty
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs with the intention of maximizing the regret of the player. Existing minmax regret models consider only deterministic solutions/strategies, and minmax regret...
متن کامل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.
متن کاملOn the approximability of minmax (regret) network optimization problems
In this paper the minmax (regret) versions of some basic polynomially solvable deterministic network problems are discussed. It is shown that if the number of scenarios is unbounded, then the problems under consideration are not approximable within logK for any ǫ > 0 unless NP ⊆ DTIME(n log ), where K is the number of scenarios.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.03.023