Adaptation of implicit search methods (Q801812)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3880441
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptation of implicit search methods |
scientific article; zbMATH DE number 3880441 |
Statements
Adaptation of implicit search methods (English)
0 references
1984
0 references
The efficiency of adapting implicit search methods is analyzed for the problem - algorithm - computer-system triad. The aim of adaptation is to minimize the upper bound of the search time for solution of an extremal combinatorial problem by optimizing the number of variables that are simultaneously introduced into the basis in each iteration. Analytical results, examples, and experimental results are presented.
0 references
tree
0 references
combinatorial problems
0 references
implementation of algorithms
0 references
problem solving system
0 references
implicit search
0 references
0.7175340056419373
0 references
