Upper Bound for the Capacitated Competitive Facility Location Problem

V. L. Beresnev, A. A. Melnikov

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

We consider the capacitated competitive facility location problem (CCFLP) where two competing firms open facilities to maximize their profits obtained from customer service. The decision making process is organized as a Stackelberg game. Both the set of candidate sites where firms may open facilities and the set of customers are finite. The customer demands are known, and the total demand covered by each of the facilities can not exceed its capacity. We propose the upper bound for the leader's objective function based on solving of the estimating MIP.

Original languageEnglish
Title of host publicationOPERATIONS RESEARCH PROCEEDINGS 2015
EditorsKF Doerner, Ljubic, G Pflug, G Tragler
PublisherSpringer International Publishing AG
Pages87-93
Number of pages7
ISBN (Print)978-3-319-42901-4
DOIs
Publication statusPublished - 2017
Externally publishedYes
EventOperations Research Conference (OR) - Vienna, Austria
Duration: 1 Sep 20154 Sep 2015

Publication series

NameOperations Research Proceedings
PublisherSPRINGER INTERNATIONAL PUBLISHING AG
ISSN (Print)0721-5924

Conference

ConferenceOperations Research Conference (OR)
CountryAustria
CityVienna
Period01.09.201504.09.2015

Cite this