{"title":"固定过去的最佳选择任务的绝对稳定性","authors":"M. Y. Kovalyov","doi":"10.29235/1561-8323-2018-62-2-147-150","DOIUrl":null,"url":null,"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.","PeriodicalId":11227,"journal":{"name":"Doklady Akademii nauk","volume":"52 1","pages":"147-150"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"АБСОЛЮТНАЯ УСТОЙЧИВОСТЬ В ЗАДАЧАХ ОПТИМАЛЬНОГО ВЫБОРА С ФИКСИРОВАННЫМ ПРОШЛЫМ\",\"authors\":\"M. Y. Kovalyov\",\"doi\":\"10.29235/1561-8323-2018-62-2-147-150\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":11227,\"journal\":{\"name\":\"Doklady Akademii nauk\",\"volume\":\"52 1\",\"pages\":\"147-150\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Doklady Akademii nauk\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.29235/1561-8323-2018-62-2-147-150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Doklady Akademii nauk","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.29235/1561-8323-2018-62-2-147-150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
АБСОЛЮТНАЯ УСТОЙЧИВОСТЬ В ЗАДАЧАХ ОПТИМАЛЬНОГО ВЫБОРА С ФИКСИРОВАННЫМ ПРОШЛЫМ
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
