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, 2013, Volume 20, Issue 5, Pages 84–96 (Mi da748)  
This article is cited in 3 scientific papers (total in 3 papers)

A deterministic algorithm for solving the Weber problem for an $n$-sequentially connected chain

R. E. Shangin

South Ural State University, 76 Lenin Ave., 454080 Chelyabinsk, Russia
Full-text PDF (302 kB) Citations (3)
References:
PDF
HTML
Abstract: The class of $n$-sequentially connected chains is introduced. Here is set an algorithm based on dynamic programming which reasonably solves the Weber problem for an $n$-sequentially connected chain and a finite set of location positions. The analysis of the proposed algorithm is given. On a set of problem cases which was randomly generated, the comparison of action period of the given algorithm and a model of integer linear programming was carried out in IBM ILOG CPLEX. Ill. 3, tab. 1, bibliogr. 16.
Keywords: Weber problem, $n$-sequentially connected chain, dynamic programming, exact algorithm.
Received: 15.11.2012
Revised: 19.03.2013
Bibliographic databases:
Document Type: Article
UDC: 519.863
Language: Russian
Citation: R. E. Shangin, “A deterministic algorithm for solving the Weber problem for an $n$-sequentially connected chain”, Diskretn. Anal. Issled. Oper., 20:5 (2013), 84–96
Citation in format AMSBIB
\Bibitem{Sha13}
\by R.~E.~Shangin
\paper A deterministic algorithm for solving the Weber problem for an $n$-sequentially connected chain
\jour Diskretn. Anal. Issled. Oper.
\yr 2013
\vol 20
\issue 5
\pages 84--96
\mathnet{http://mi.mathnet.ru/da748}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=3184446}
Linking options:
  • https://www.mathnet.ru/eng/da748
  • https://www.mathnet.ru/eng/da/v20/i5/p84
    • 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