Discrete models for competitive location with foresight Export

@article{citeulike:1663385, abstract = {We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor's later entry. We develop mixed zero-one programming formulations for each of the following three strategies: the maxmin strategy where the worst possible competitor choice is considered, the minimum regret strategy, and the von Stackelberg strategy in which the competitor also optimises its market share. Some computational results show the feasibility and limits of these models.}, author = {Plastria, Frank and Vanhaverbeke, Lieselot}, booktitle = {Part Special Issue: New Trends in Locational Analysis}, citeulike-article-id = {1663385}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.cor.2006.05.006}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6VC5-4K7WJG9-2/2/b1402b52770446b4656855bce749b16e}, doi = {10.1016/j.cor.2006.05.006}, journal = {Computers \& Operations Research}, keywords = {algorithm, learning, optimization}, month = {March}, number = {3}, pages = {683--700}, posted-at = {2007-09-16 19:44:46}, priority = {3}, title = {Discrete models for competitive location with foresight}, url = {http://dx.doi.org/10.1016/j.cor.2006.05.006}, volume = {35}, year = {2008} }

TY - JOUR ID - citeulike:1663385 L3 - citeulike-article-id:1663385 N2 - We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor's later entry. We develop mixed zero-one programming formulations for each of the following three strategies: the maxmin strategy where the worst possible competitor choice is considered, the minimum regret strategy, and the von Stackelberg strategy in which the competitor also optimises its market share. Some computational results show the feasibility and limits of these models. IS - 3 JF - Computers & Operations Research EP - 700 TI - Discrete models for competitive location with foresight VL - 35 T2 - Part Special Issue: New Trends in Locational Analysis SP - 683 KW - algorithm KW - learning KW - optimization AU - Plastria, Frank AU - Vanhaverbeke, Lieselot PY - 2008/03// UR - http://dx.doi.org/10.1016/j.cor.2006.05.006 ER -