Exact method for the capacitated competitive facility location problem
Year of publication: |
July 2018
|
---|---|
Authors: | Beresnev, Vladimir ; Melnikov, Andrey |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 95.2018, p. 73-82
|
Subject: | Bi-level programming | Stackelberg game | Branch-and-bound | Discrete competitive location | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Räumlicher Wettbewerb | Spatial competition | Standorttheorie | Location theory | Spieltheorie | Game theory |
-
A new heuristic formulation for a competitive maximal covering location problem
Seyhan, Tolga H., (2018)
-
A Stackelberg hub arc location model for a competitive environment
Sasaki, Mihiro, (2014)
-
Rohaninejad, Mohammad, (2017)
- More ...
-
Beresnev, Vladimir, (2020)
-
Approximation of the competitive facility location problem with MIPs
Beresnev, Vladimir, (2019)
-
Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting
Beresnev, Vladimir, (2023)
- More ...