Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Wyszukiwanie zaawansowane
Raport Badawczy = Research Report ; RB/2/2007
Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences
16 pages ; 21 cm ; Bibliography p. 15-16
The paper considers so-called generic combinatorial optimization problem, where the set of feasible solutions is some family of subsets of a finite ground set with specified positive initial weights of elements, and the objective function represents the total weight of elements of a feasible solution. It is assumed that the weights of all elements may be perturbed simultaneously and independently up to a given percentage of their initial values. A feasible solution, which minimizes then the worst-case relative regret, is called a robust solution. The maximum percentage level of perturbations, for which an initially optimal solution remains robust, is called the robustness radius of this solution. In this paper the robustness aspect of initially optimal solutions and provide lower bounds for their robustness radii are studied.
Raport Badawczy = Research Report
Creative Commons Attribution BY 4.0 license
Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -
Systems Research Institute of the Polish Academy of Sciences
Library of Systems Research Institute PAS
19 paź 2021
17 wrz 2020
44
https://rcin.org.pl./publication/175217
Nazwa wydania | Data |
---|---|
RB-2007-02 : Libura Marek Sylwester : On the robustness of optimal solutions for combinatorial optimization problems | 19 paź 2021 |
Libura, Marek
Libura, Marek
Libura, Marek
Libura, Marek
Libura, Marek