Use of random search in solving discrete extremal problems

DOI10.1007/BF01072025MaRDI QIDQ3315286zbMATH OpenFDO

Authors V. G. Ustyuzhaninov

Publication date 1983

Published in Cybernetics (Search for Journal in Brave)

zbMATH Keywords

random searchtheoretical study of efficiency

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• scientific article; zbMATH DE number 4199967
• Solution quality of random search methods for discrete stochastic optimization
• scientific article; zbMATH DE number 4064766
• scientific article; zbMATH DE number 1724436
• scientific article; zbMATH DE number 3990213
• Random search method for solving series of linear programming problems
• On Random Search for a Global Extremum
• scientific article; zbMATH DE number 3920191
• scientific article; zbMATH DE number 4216294
• scientific article; zbMATH DE number 3956836

Cited in

(10)

• scientific article; zbMATH DE number 3987063 (Why is no real title available?)
• scientific article; zbMATH DE number 4199967 (Why is no real title available?)
• Finding passwords by random walks: how long does it take?
• Effort associated with a class of random optimization methods
• scientific article; zbMATH DE number 3920191 (Why is no real title available?)
• Exploiting erraticism in search
• Exhaustive versus randomized searches for nonlinear optimization in 21st century computing: solar application
• scientific article; zbMATH DE number 3857170 (Why is no real title available?)
• Algorithmic search in group theory
• scientific article; zbMATH DE number 4075001 (Why is no real title available?)

This page was built for publication: Use of random search in solving discrete extremal problems

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