Перебор субоптимальных решений в дискретных задачах оптимизации

Authors

  • Joseph Romanovsky

Keywords:

suboptimal solutions, discrete optimization, dynamic programming

Abstract

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

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

Most read articles by the same author(s)

1 2 > >>