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, 2009, Volume 16, Issue 2, Pages 21–41 (Mi da566)  
This article is cited in 32 scientific papers (total in 32 papers)

A branch and bound method for the facility location problem with customer preferences

I. L. Vasiliev, K. B. Klimentova

Institute of System Dynamics and Control Theory SB RAS, Irkutsk, Russia
Full-text PDF (835 kB) Citations (32)
References:
PDF
HTML
Abstract: The article is focused on computational study of the bilevel facility location problem with customer's preferences taken into account. Different integer linear programming formulations are considered. The cutting plane method is implemented for the new family of valid inequalities which are based on relation with the problem for a pair of matrices. The optimal solution of the problem is searched by two variants of branch and bound method using the cutting plane method implemented. The upper bounds for these exact methods are found by Simulated Annealing method. The computational experience illustrates the effectiveness of the proposed methods in comparison with the known approaches. Pic. 1, tabl. 7, bibl. 15.
Keywords: bilevel facility location problem, cutting plane method, local search, branch and bound method.
Received: 07.11.2008
Revised: 04.02.2009
English version:
Journal of Applied and Industrial Mathematics, 2010, Volume 4, Issue 3, Pages 441–454
DOI: https://doi.org/10.1134/S1990478910030178
Bibliographic databases:
UDC: 519.854.2
Language: Russian
Citation: I. L. Vasiliev, K. B. Klimentova, “A branch and bound method for the facility location problem with customer preferences”, Diskretn. Anal. Issled. Oper., 16:2 (2009), 21–41; J. Appl. Industr. Math., 4:3 (2010), 441–454
Citation in format AMSBIB
\Bibitem{VasKli09}
\by I.~L.~Vasiliev, K.~B.~Klimentova
\paper A branch and bound method for the facility location problem with customer preferences
\jour Diskretn. Anal. Issled. Oper.
\yr 2009
\vol 16
\issue 2
\pages 21--41
\mathnet{http://mi.mathnet.ru/da566}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2574307}
\zmath{https://zbmath.org/?q=an:1249.90080}
\transl
\jour J. Appl. Industr. Math.
\yr 2010
\vol 4
\issue 3
\pages 441--454
\crossref{https://doi.org/10.1134/S1990478910030178}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77956112361}
Linking options:
  • https://www.mathnet.ru/eng/da566
  • https://www.mathnet.ru/eng/da/v16/i2/p21
    • This publication is cited in the following 32 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:1393
    Full-text PDF :273
    References:73
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024