An algorithm for the solution of constrained generalised polynomial programming problems
From MaRDI portal
Publication:4772102
DOI10.1093/comjnl/17.3.261zbMath0284.65053OpenAlexW1977503947MaRDI QIDQ4772102
C. O. Jelinek, Dana H. Ballard, Roland Schinzinger
Publication date: 1974
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/17.3.261
Related Items
Simulated annealing for constrained global optimization ⋮ Global optimization algorithms for a CAD workstation ⋮ Integral global minimization: Algorithms, implementations and numerical tests ⋮ The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization ⋮ Global optimization by controlled random search ⋮ On the convergence of the Baba and Dorea random optimization methods