Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2013, Number 4(22), Pages 96–102 (Mi pdm437)  
This article is cited in 1 scientific paper (total in 1 paper)

Computational Methods in Discrete Mathematics

Exact algorithm for solving discrete Weber problem for a cycle

R. E. Shangin

South Ural State University, Chelyabinsk, Russia
Full-text PDF (616 kB) Citations (1)
References:
PDF
HTML
Abstract: A polynomial algorithm solving discrete Weber problem for cycle and for finite set of location positions is presented. The algorithm is based on the dynamic programming idea. The comparison of action times of the given algorithm and of an integer linear programming model, which was realized in IBM ILOG CPLEX, is carried out.
Keywords: Weber problem, cycle, dynamic programming, exact algorithm.
Document Type: Article
UDC: 519.863
Language: Russian
Citation: R. E. Shangin, “Exact algorithm for solving discrete Weber problem for a cycle”, Prikl. Diskr. Mat., 2013, no. 4(22), 96–102
Citation in format AMSBIB
\Bibitem{Sha13}
\by R.~E.~Shangin
\paper Exact algorithm for solving discrete Weber problem for a~cycle
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 4(22)
\pages 96--102
\mathnet{http://mi.mathnet.ru/pdm437}
Linking options:
  • https://www.mathnet.ru/eng/pdm437
  • https://www.mathnet.ru/eng/pdm/y2013/i4/p96
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:239
    Full-text PDF :101
    References:32
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024