Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zh. Vychisl. Mat. Mat. Fiz.:
Year:
Volume:
Issue:
Page:
Find




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

Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2007, Volume 47, Number 9, Pages 1524–1537 (Mi zvmmf247)  
This article is cited in 2 scientific papers (total in 2 papers)

Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method

M. A. Posypkina, I. Kh. Sigalb

a Institute of Systems Analysis, Russian Academy of Sciences, pr. Shestidesyatiletiya Oktyabrya 9, Moscow, 117312, Russia
b Computing Center, Russian Academy of Sciences, ul. Vavilova 40, Moscow, 119991, Russia
Full-text PDF (2170 kB) Citations (2)
References:
PDF
HTML
Abstract: A scheme for the parallel implementation of the combined branch-and-bound method and heuristic algorithms is proposed. Results of computations for the one-dimensional Boolean knapsack problem are presented that demonstrate the efficiency of the proposed approach. The main factors that affect the speedup of the solution when local optimization is used are discussed.
Key words: knapsack problem, branch-and-bound method, algorithms for parallel computations, discrete optimization, local optimization.
Received: 08.02.2007
English version:
Computational Mathematics and Mathematical Physics, 2007, Volume 47, Issue 9, Pages 1464–1476
DOI: https://doi.org/10.1134/S0965542507090084
Bibliographic databases:
Document Type: Article
UDC: 519.6:519.852.6
Language: Russian
Citation: M. A. Posypkin, I. Kh. Sigal, “Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method”, Zh. Vychisl. Mat. Mat. Fiz., 47:9 (2007), 1524–1537; Comput. Math. Math. Phys., 47:9 (2007), 1464–1476
Citation in format AMSBIB
\Bibitem{PosSig07}
\by M.~A.~Posypkin, I.~Kh.~Sigal
\paper Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method
\jour Zh. Vychisl. Mat. Mat. Fiz.
\yr 2007
\vol 47
\issue 9
\pages 1524--1537
\mathnet{http://mi.mathnet.ru/zvmmf247}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2387661}
\transl
\jour Comput. Math. Math. Phys.
\yr 2007
\vol 47
\issue 9
\pages 1464--1476
\crossref{https://doi.org/10.1134/S0965542507090084}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34848826510}
Linking options:
  • https://www.mathnet.ru/eng/zvmmf247
  • https://www.mathnet.ru/eng/zvmmf/v47/i9/p1524
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Журнал вычислительной математики и математической физики Computational Mathematics and Mathematical Physics
    Statistics & downloads:
    Abstract page:470
    Full-text PDF :282
    References:38
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024