Geodesic
A branch and bound method for the facility location problem with customer preferences
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 2, pp. 21-41

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DA_2009_16_2_a2,
     author = {I. L. Vasiliev and K. B. Klimentova},
     title = {A branch and bound method for the facility location problem with customer preferences},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {21--41},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_2_a2/}
}
TY  - JOUR
AU  - I. L. Vasiliev
AU  - K. B. Klimentova
TI  - A branch and bound method for the facility location problem with customer preferences
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 21
EP  - 41
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_2_a2/
LA  - ru
ID  - DA_2009_16_2_a2
ER  - 
%0 Journal Article
%A I. L. Vasiliev
%A K. B. Klimentova
%T A branch and bound method for the facility location problem with customer preferences
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 21-41
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_2_a2/
%G ru
%F DA_2009_16_2_a2
I. L. Vasiliev; K. B. Klimentova. A branch and bound method for the facility location problem with customer preferences. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 2, pp. 21-41. http://geodesic.mathdoc.fr/item/DA_2009_16_2_a2/