Preprints of the Keldysh Institute of Applied Mathematics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Keldysh Institute preprints:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Preprints of the Keldysh Institute of Applied Mathematics, 2005, 082, 19 pp. (Mi ipmp723)  

Meta-methods in $\mathcal{NP}$-programming

A. V. Vorozhtsov
Abstract: The work concerns basic notions used for constructing approximation method for solution of $\mathcal{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.
Document Type: Preprint
Language: Russian
Citation: A. V. Vorozhtsov, “Meta-methods in $\mathcal{NP}$-programming”, Keldysh Institute preprints, 2005, 082, 19 pp.
Citation in format AMSBIB
\Bibitem{Vor05}
\by A.~V.~Vorozhtsov
\paper Meta-methods in $\mathcal{NP}$-programming
\jour Keldysh Institute preprints
\yr 2005
\papernumber 082
\totalpages 19
\mathnet{http://mi.mathnet.ru/ipmp723}
Linking options:
  • https://www.mathnet.ru/eng/ipmp723
  • https://www.mathnet.ru/eng/ipmp/y2005/p82
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Препринты Института прикладной математики им. М. В. Келдыша РАН
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024