@inproceedings{48f7bbe85acf43a4bcacb5053d53ca6a,
title = "Tabu search approach for the bi-level competitive base station location problem",
abstract = "This paper addresses the competitive base stations location problem with sharing. Two mobile operators, the leader and the follower, compete to attract customers from a given market of high-speed internet connection. The leader acts first by placing a number of base stations, anticipating that the follower will react to the decision by creating his own network. The Leader can share BS cites with the follower operator, receiving a rent payment from him. We propose new model of realistic clients behavior, when the choice of the operator is made upon the average quality of service. We provide a formulation of this problem as a nonlinear integer programming problem. We propose a fast tabu search heuristic for this problem and provide some computational results.",
keywords = "Bilevel programming, Competitive location, Tabu search",
author = "Ivan Davydov and Marceau Coupechoux and Stefano Iellamo",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 9th International Conference on Discrete Optimization and Operations Research, DOOR 2016 ; Conference date: 19-09-2016 Through 23-09-2016",
year = "2016",
month = jan,
day = "1",
doi = "10.1007/978-3-319-44914-2\_29",
language = "English",
isbn = "9783319449135",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "364--372",
editor = "Michael Khachay and Panos Pardalos and Yury Kochetov and Vladimir Beresnev and Evgeni Nurminski",
booktitle = "Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings",
}