Abstract:
The effectiveness of adaptive implicit search methods is analyzed for a three member unit of the problem the algorithm, and the computing system. The adaptation goal is to minimize the upper boundary of time needed to find solutions of the extremal combinatorial problem by optimizing the number of variables introduced into the basis ati every iteration. Analytical results, examples, and experimental results are given.
Fulltext:
PDF file (1558 kB)