Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 3, Pages 64–75 (Mi da776)  
This article is cited in 3 scientific papers (total in 3 papers)

An exact algorithm for solving the discrete Weber problem for a $k$-tree

A. V. Panyukov, R. E. Shangin

South Ural State University, 76 Lenin Ave., 454080 Chelyabinsk, Russia
Full-text PDF (285 kB) Citations (3)
References:
PDF
HTML
Abstract: We consider the discrete Weber problem. A consistent deterministic algorithm for finding an exact solution to the problem for a $k$-tree and a finite set of placement positions is suggested. The algorithm is based on the idea of dynamic programming with a decomposition tree. A numerical experiment was performed to examine the effectiveness of the proposed algorithm in comparison with IBM ILOG CPLEX. Ill. 2, bibliogr. 23.
Keywords: Weber problem, $k$-tree, dynamic programming, decomposition tree, exact algorithm.
Received: 03.09.2013
Revised: 31.01.2014
Bibliographic databases:
Document Type: Article
UDC: 519.863
Language: Russian
Citation: A. V. Panyukov, R. E. Shangin, “An exact algorithm for solving the discrete Weber problem for a $k$-tree”, Diskretn. Anal. Issled. Oper., 21:3 (2014), 64–75
Citation in format AMSBIB
\Bibitem{PanSha14}
\by A.~V.~Panyukov, R.~E.~Shangin
\paper An exact algorithm for solving the discrete Weber problem for a~$k$-tree
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 3
\pages 64--75
\mathnet{http://mi.mathnet.ru/da776}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3242102}
Linking options:
  • https://www.mathnet.ru/eng/da776
  • https://www.mathnet.ru/eng/da/v21/i3/p64
    • This publication is cited in the following 3 articles:
    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, 2025