New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
Year of publication: |
March 2017
|
---|---|
Authors: | Fernández, Pascual ; Pelegrín, Blas ; Lančinskas, Algirdas ; Žilinskas, Julius |
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. 79.2017, p. 12-18
|
Subject: | Competitive location | Heuristic algorithm | Binary and partially binary rules | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice |
-
An efficient heuristic algorithm for the capacitated p-median problem
Yaghini, Masoud, (2013)
-
An efficient heuristic algorithm for the alternative-fuel station location problem
Tran Trung Hieu, (2018)
-
A sample approximation solution procedure for chance-constrained districting problems
Baldassarre, Silvia, (2023)
- More ...
-
A preference-based multi-objective evolutionary algorithm R-NSGA-II with stochastic local search
Filatovas, Ernestas, (2017)
-
Profit maximization and reduction of the cannibalization effect in chain expansion
Pelegrín, Blas, (2016)
-
On tie breaking in competitive location under binary customer behavior
Pelegrín, Blas, (2014)
- More ...