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, 2016, Volume 23, Issue 1, Pages 82–96
DOI: https://doi.org/10.17377/daio.2016.23.489 (Mi da840) 		 
This article is cited in 11 scientific papers (total in 11 papers)

An algorithm for approximate solution to the Weber problem on a line with forbidden gaps

G. G. Zabudsky, N. S. Veremchuk

Omsk department of S. L. Sobolev Institute of Mathematics, SB RAS, 13 Pevtsov St., 644099 Omsk, Russia
Full-text PDF (283 kB) Citations (11)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2016.23.489
Abstract: The location problem of interconnected facilities on a line with forbidden gaps is considered. The properties of the problem which allow the initial continuous problem to be reduced to the discrete problem are found. The approximate algorithm for solving the problem is developed and the results of computational experiments are presented. Tab. 1, bibliogr. 15.
Keywords: location problem, interconnected facilities, approximate decision.
Received: 29.04.2015
Revised: 10.08.2015
English version:
Journal of Applied and Industrial Mathematics, 2016, Volume 10, Issue 1, Pages 136–144
DOI: https://doi.org/10.1134/S1990478916010154
Bibliographic databases:
Document Type: Article
UDC: 519.854
Language: Russian
Citation: G. G. Zabudsky, N. S. Veremchuk, “An algorithm for approximate solution to the Weber problem on a line with forbidden gaps”, Diskretn. Anal. Issled. Oper., 23:1 (2016), 82–96; J. Appl. Industr. Math., 10:1 (2016), 136–144
Citation in format AMSBIB
\Bibitem{ZabVer16}
\by G.~G.~Zabudsky, N.~S.~Veremchuk
\paper An algorithm for approximate solution to the Weber problem on a~line with forbidden gaps
\jour Diskretn. Anal. Issled. Oper.
\yr 2016
\vol 23
\issue 1
\pages 82--96
\mathnet{http://mi.mathnet.ru/da840}
\crossref{https://doi.org/10.17377/daio.2016.23.489}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3555677}
\elib{https://elibrary.ru/item.asp?id=25792214}
\transl
\jour J. Appl. Industr. Math.
\yr 2016
\vol 10
\issue 1
\pages 136--144
\crossref{https://doi.org/10.1134/S1990478916010154}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84961590053}
Linking options:
  • https://www.mathnet.ru/eng/da840
  • https://www.mathnet.ru/eng/da/v23/i1/p82
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:379
    Full-text PDF :151
    References:70
    First page:32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024