Approximation of the competitive facility location problem with MIPs
Year of publication: |
2019
|
---|---|
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. 104.2019, p. 139-148
|
Subject: | Location | Stackelberg game | Bi-level programming | Cut generation | Branch-and-bound | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Spieltheorie | Game theory | Räumlicher Wettbewerb | Spatial competition | Standorttheorie | Location theory |
-
Exact method for the capacitated competitive facility location problem
Beresnev, Vladimir, (2018)
-
A new heuristic formulation for a competitive maximal covering location problem
Seyhan, Tolga H., (2018)
-
A local search heuristic for the (r|p)-centroid problem in the plane
Davydov, I., (2014)
- More ...
-
Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting
Beresnev, Vladimir, (2023)
-
Exact method for the capacitated competitive facility location problem
Beresnev, Vladimir, (2018)
-
Beresnev, Vladimir, (2020)
- More ...