RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2009, Volume 16, Number 5, Pages 3–18 (Mi da582)  

This article is cited in 3 scientific papers (total in 3 papers)

Polynomial algorithm for the path facility location problem with uniform capacities

A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin

S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia

Abstract: The Facility Location Problem with uniform capacities on path graphs is considered. Earlier it was shown by Ageev that this problem can be solved in $O(m^3n^3+m^5n^2)$ time, where $m$ is the number of facilities and $n$ is the number of clients. In the paper the modified algorithm is presented that has reduced infinitesimal order for the time complexity $O(m^4n^2)$. Ill. 9, bibl. 24.

Keywords: facility location, uniform capacities, path graphs, polynomial-time algorithm.

Full text: PDF file (297 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.8
Received: 25.06.2009

Citation: A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin, “Polynomial algorithm for the path facility location problem with uniform capacities”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 3–18

Citation in format AMSBIB
\Bibitem{AgeGimKur09}
\by A.~A.~Ageev, E.~Kh.~Gimadi, A.~A.~Kurochkin
\paper Polynomial algorithm for the path facility location problem with uniform capacities
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 5
\pages 3--18
\mathnet{http://mi.mathnet.ru/da582}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2590750}
\zmath{https://zbmath.org/?q=an:1249.90295}


Linking options:
  • http://mi.mathnet.ru/eng/da582
  • http://mi.mathnet.ru/eng/da/v16/i5/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. Kh. Gimadi, A. A. Kurochkin, “Uniform Capacitated Facility Location Problem with Random Input Data”, J. Math. Sci., 188:4 (2013), 359–377  mathnet  crossref
    2. G. G. Zabudskii, A. A. Koval', “Solving a maximin location problem on the plane with given accuracy”, Autom. Remote Control, 75:7 (2014), 1221–1230  mathnet  crossref  isi
    3. A. A. Kurochkin, “Capacitated facility location problem on random input data”, J. Appl. Industr. Math., 8:4 (2014), 541–551  mathnet  crossref  mathscinet
  • Дискретный анализ и исследование операций
    Number of views:
    This page:454
    Full text:124
    References:41
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020