Autor:	V. V. Yatskevich, V. V. Moiseenko
Rok vydání:	2001
Předmět:	Continuous optimization Extremal optimization Mathematical optimization Optimization problem General Computer Science Heuristic (computer science) Computer science Discrete optimization Multi-swarm optimization Global optimization Metaheuristic
Zdroj:	Cybernetics and Systems Analysis. 37:727-734
ISSN:	1060-0396
DOI:	10.1023/a:1013862824209
Popis:	Application of the heuristic self-organization method (or the so-called Group Method of Data Handling) to the solution of discrete optimization problems is considered. Convergence by probability of the self-organization process to a global optimization point is proved. Some examples of numerical experiments are presented.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::96559ad1f89e2f686919161a96941766 https://doi.org/10.1023/a:1013862824209 Zobrazit plný text záznamu Full text from SpringerLink