A linear time algorithm for inverse obnoxious center location problems on networks
Year of publication: |
2013
|
---|---|
Authors: | Alizadeh, Behrooz ; Burkard, Rainer E. |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 21.2013, 3, p. 585-594
|
Subject: | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm |
-
On a class of algorithms solving the multifacility location problem with perturbed Lp-distances
Frenk, J. B., (1994)
-
Minimax regret 1-sink location problem with accessibility in dynamic general networks
Li, Hongmei, (2016)
-
A convex hull algorithm for solving a location problem
Nguyen Kieu Linh, (2015)
- More ...
-
Inverse median location problems with variable coordinates
Baroughi Bonab, Fahimeh, (2010)
-
A linear time algorithm for inverse obnoxious center location problems on networks
Alizadeh, Behrooz, (2013)
-
Inverse median location problems with variable coordinates
Baroughi Bonab, Fahimeh, (2010)
- More ...