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 5, Pages 23–39 (Mi da791)  

Capacitated facility location problem on random input data

A. A. Kurochkin

S. L. Sobolev Institute of Mathematics, SB RAS, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
References:
Abstract: The Capacitated Facility Location Problem (CLFP) on random input data is considered. It is assumed that the transportation costs take random values according to discrete uniform distribution on the integer segment $[1,r]$. For CFLP with uniform capacity restrictions an algorithm with time complexity $O(n\log m)$ is constructed and conditions of asymptotical optimality are established (where $n$ is the number of consumers and $m$ is the number of facilities). For CFLP with various capacities an algorithm with time complexity $O(n^{2(1-\theta)}m)$ is given and the conditions of asymptotical optimality for some $\theta<\frac12$ are established. Ill. 1, bibliogr. 17.
Keywords: facility location problem, polynomial algorithm, probability, asymptotical optimality.
Received: 28.10.2013
Revised: 05.05.2014
English version:
Journal of Applied and Industrial Mathematics, 2014, Volume 8, Issue 4, Pages 541–551
DOI: https://doi.org/10.1134/S1990478914040115
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: A. A. Kurochkin, “Capacitated facility location problem on random input data”, Diskretn. Anal. Issled. Oper., 21:5 (2014), 23–39; J. Appl. Industr. Math., 8:4 (2014), 541–551
Citation in format AMSBIB
\Bibitem{Kur14}
\by A.~A.~Kurochkin
\paper Capacitated facility location problem on random input data
\jour Diskretn. Anal. Issled. Oper.
\yr 2014
\vol 21
\issue 5
\pages 23--39
\mathnet{http://mi.mathnet.ru/da791}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3328835}
\transl
\jour J. Appl. Industr. Math.
\yr 2014
\vol 8
\issue 4
\pages 541--551
\crossref{https://doi.org/10.1134/S1990478914040115}
Linking options:
  • https://www.mathnet.ru/eng/da791
  • https://www.mathnet.ru/eng/da/v21/i5/p23
  • 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, 2024