Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 136–137 (Mi pdma113)  
Computational methods in discrete mathematics

Exact algorithm for solving special case of discrete Weber problem

R. E. Shangin

South Ural State University, Chelyabinsk
Full-text PDF (438 kB)
References:
PDF
HTML
Abstract: An algorithm reasonably solving Weber problem for $n$-sequentially connected chain and finite set of points of location is described. The algorithm is compared with an integer linear programming algorithm realized in IBM ILOG CPLEX.
Keywords: Weber problem, n-sequentially connected chain, dynamic programming, exact algorithm, quasi-polynomial algorithm.
Document Type: Article
UDC: 519.863
Language: Russian
Citation: R. E. Shangin, “Exact algorithm for solving special case of discrete Weber problem”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 136–137
Citation in format AMSBIB
\Bibitem{Sha13}
\by R.~E.~Shangin
\paper Exact algorithm for solving special case of discrete Weber problem
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 136--137
\mathnet{http://mi.mathnet.ru/pdma113}
Linking options:
  • https://www.mathnet.ru/eng/pdma113
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p136
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025