Перебор субоптимальных решений в дискретных задачах оптимизации
Keywords:
suboptimal solutions, discrete optimization, dynamic programmingAbstract
The paper presents an approach to enumeration of suboptimal solutions, based on introduction of special processes of enumeration – «enumerators», which solve problems of that kind for various smaller problems. Some special operations presented in the paper allow us to make the required enumerators of simpler ones. Some examples are presented.
Downloads
Published
2012-12-31
Issue
Section
Computer science
License
How to Cite
[1]
“Перебор субоптимальных решений в дискретных задачах оптимизации”, Comput. Tools Educ., no. 6, Dec. 2012, Accessed: Oct. 23, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1327
