Use of random search in solving discrete extremal problems

DOI10.1007/BF01072025zbMath0532.90081MaRDI QIDQ3315286

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

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

Cites Work

• Unnamed Item

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