Volume 21, No 2, 2014, P. 3–23

UDC 519.87
Beresnev V. L., Melnikov . .
Branch-and-bound method for the competitive facility location problem with prescribed choice of suppliers

The mathematical model is being considered, where two competing sides sequentially open their facilities with the goal to capture customers and maximize profit. The model can be written as the bi-level integer programming problem. Optimal noncooperative solutions are considered as optimal solutions of the problem. In order to provide approximate and exact solutions of the problem the branch-and-bound method is proposed. Computational experiments show capability of the method to solve small and medium instances.
Tab. 2, bibliogr. 6.

Keywords: bi-level programming, optimal noncooperative solution, pseudo-Boolean function, branch-and-bound method.

Beresnev Vladimir Leonidovich 1,2
Mel’nikov Andrey Andreevich 1,2

1. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: beresnev@math.nsc.ru, a.a.melnikov@hotmail.com

 © Sobolev Institute of Mathematics, 2015