[Epsilon]-constraint method for bi-objective competitive facility location problem with uncertain demand scenario
Year of publication: |
2020
|
---|---|
Authors: | Beresnev, Vladimir ; Melnikov, Andrey |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 8.2020, 1, p. 33-59
|
Subject: | Bi-level programming | Location | Multi-criteria optimization | Stackelberg game | Uncertainty | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Spieltheorie | Game 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)
-
Approximation of the competitive facility location problem with MIPs
Beresnev, Vladimir, (2019)
- More ...
-
Approximation of the competitive facility location problem with MIPs
Beresnev, Vladimir, (2019)
-
Exact method for the capacitated competitive facility location problem
Beresnev, Vladimir, (2018)
-
Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting
Beresnev, Vladimir, (2023)
- More ...