Title:

A note on robustness tolerances for combinatorial optimization problems

Subtitle:

Raport Badawczy = Research Report ; RB/16/2009

Creator:

Libura, Marek

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Date issued/created:

2009

Description:

10 pages ; 21 cm ; Bibliography p. 9-10

Subject and Keywords:

Robust solutions ; Robustness tolerances ; Miary odporności ; Problemy kombinatoryczne ; Rozwiązania odporne ; Combinatorial problems

Abstract:

This paper gives formulae for computing the robustness tolerances with respect to an optimal solution obtained for some initial weights and shows that this can be done in polynomial time whenever the optimization problem is polynomially solvable itself.

Relation:

Raport Badawczy = Research Report

Resource type:

Text

Detailed Resource Type:

Report

Source:

RB-2009-16

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

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: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open