АБСОЛЮТНАЯ УСТОЙЧИВОСТЬ В ЗАДАЧАХ ОПТИМАЛЬНОГО ВЫБОРА С ФИКСИРОВАННЫМ ПРОШЛЫМ

Abstract

A novel approach to solving optimal selection problems under dynamic uncertainty is described. The approach is called absolute robustness with fixed past. An efficient algorithm is presented for the main problem and several its variants. The approach can be employed for solving other combinatorial optimization problems under dynamic uncertainty.