KIAM Main page Web Library  •  Publication Searh  Русский 

KIAM Preprint № 82, Moscow, 2005
Authors: Voroztsov A.V.
Meta-methods in NP-programming
The work concerns basic notions used for constructing approximation method for solution of NP-hard and poorly formalized complex problems. Most of these notions are well-known. Detailed description of these notions and their use-cases are given. Method of inferring macro-entities (macro-objects and macro-actions) is proposed. Attention is paid to the metasystem transactions on the level of algorithm organization. Simulated annealing, scaling method, genetic algorithms and other known methods are considered in this context and decomposed into more elementary metaheuristics.
NP-programming, NP-hard problems, metasystem transitions, simulated annealing, genetic algorithms, scaling method
Publication language: russian, pages: 19
Research direction:
Programming, parallel computing, multimedia
Source text: