Adaptive stability in combinatorial optimization problems
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 20 (2014) no. 1, pp. 100-108
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider a general approach to the construction of necessary, sufficient, and necessary and sufficient conditions that allow to “adapt” a known optimal solution of an abstract combinatorial problem with a certain structure to a change in the initial data set for a fixed cost function “easily” from the combinatorial point of view. We call this approach adaptive stability. Apparently, it is the first time that the approach is described for an abstract problem in a rigorous mathematical formalization.
Keywords:
stability, combinatorial optimization problem, disturbance of the initial data set.
Mots-clés : adaptation of solutions
Mots-clés : adaptation of solutions
@article{TIMM_2014_20_1_a9,
author = {E. E. Ivanko},
title = {Adaptive stability in combinatorial optimization problems},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {100--108},
publisher = {mathdoc},
volume = {20},
number = {1},
year = {2014},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2014_20_1_a9/}
}
E. E. Ivanko. Adaptive stability in combinatorial optimization problems. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 20 (2014) no. 1, pp. 100-108. http://geodesic.mathdoc.fr/item/TIMM_2014_20_1_a9/