Branch-and-bound algorithm for a competitive facility location problem
Year of publication: |
2013
|
---|---|
Authors: | Beresnev, Vladimir |
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. 40.2013, 8, p. 2062-2070
|
Subject: | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Räumlicher Wettbewerb | Spatial competition |
-
A Huff-like location model with quality adjustment and/or closing of existing facilities
G.-Tóth, Boglárka, (2024)
-
A branch-and-bound algorithm for the maximum capture problem with random utilities
Freire, Alexandre S., (2016)
-
A separation algorithm for the simple plant location problem
Galli, Laura, (2021)
- More ...
-
Branch, Bound & Cut Algorithm for the Competitive Facility Location Problem with Income Targeting
Beresnev, Vladimir, (2023)
-
Approximation of the competitive facility location problem with MIPs
Beresnev, Vladimir, (2019)
-
Exact method for the capacitated competitive facility location problem
Beresnev, Vladimir, (2018)
- More ...