@misc{Libura_Marek_Robustness_2008,
 author={Libura, Marek},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2008},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={The paper adresses the so-called generic combinatorial optimization problem, where the set of feasible solutions is some family of nonempty subsets of a finite ground set with specified positive initial weights of elements, and the objective function represents the total weight of elements of the feasible solution. It is assumed that the set of feasible solutions is fixed, but the weights of elements may be perturbed or are given with errors. All possible realizations of weights form the set of scenarios. A feasible solution, which for a given set of scenarios guarantees the minimum value of the worst-case relative regret among all the feasible solutions, is called a robust solution. The maximum percentage perturbation of a single weight, which does not destroy the robustness of a given solution, is called the robustness tolerance of this weight with respect to the solution considered. This paper presents formulae which allow calculating the robustness tolerances with respect to an optimal solution obtained for some initial weights.},
 title={Robustness tolerances for combinatorial optimization problems},
 type={Text},
 URL={http://www.rcin.org.pl/Content/144774/PDF/RB-2008-04.pdf},
 keywords={Combinatorial optimization, Optymalizacja kombinatoryczna, Analiza wrażliwości, Robustness and sensitivity analysis, Analiza odporności, Robustness tolerances, Miary odporności},
}