Adaptive stability in combinatorial optimization problems

被引：0
|
作者：
Ivanko, E. E. [1 ]
机构：
[1] Russian Acad Sci, Ural Branch, NN Krasovsky Inst Math & Mech, Moscow, Russia
来源：
TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN | 2014年 / 20卷 / 01期
关键词：
stability; combinatorial optimization problem; adaptation of solutions; disturbance of the initial data set;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：100 / 108
页数：9
相关论文
共 50 条
12345