Adaptation of implicit search methods

MaRDI QIDQ801812zbMATH OpenFDO

Authors Vitali Oscarovich Groppen

Publication date 1984

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

combinatorial problemsimplementation of algorithmsimplicit searchproblem solving systemtree

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Algorithms in computer science (68W99) Integer programming (90C10)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 2106791
• scientific article; zbMATH DE number 1014712
• scientific article; zbMATH DE number 3980925
• A method for the implicit exhaustive search of solutions to some extremum problems on sets
• Alternative adaptation of the structure of search optimization algorithms using specimen recognition methods

Cited in

(1)

• scientific article; zbMATH DE number 2106791 (Why is no real title available?)

This page was built for publication: Adaptation of implicit search methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801812)