A fast algorithm for the rectilinear distance location problem
Year of publication: |
August 2018
|
---|---|
Authors: | Nobakhtian, S. ; Dehkordi, A. Raeisi |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 88.2018, 1, p. 81-98
|
Subject: | Box constraints | Location | Rectilinear distance | Subdifferential | Betriebliche Standortwahl | Firm location choice | Algorithmus | Algorithm | Transportkosten | Transport costs | Mathematische Optimierung | Mathematical programming | Standorttheorie | Location theory | Ganzzahlige Optimierung | Integer programming | Geographische Entfernung | Geographic distance |
-
Continuous location model of a rectangular barrier facility
Miyagawa, Masashi, (2017)
-
Krivulin, Nikolai, (2017)
-
A mean-shift algorithm for large-scale planar maximal covering location problems
He, Zhou, (2016)
- More ...
-
An algorithm for generalized constrained multi-source Weber problem with demand substations
Nobakhtian, S., (2018)
-
Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
Kanzi, N., (2010)
-
Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
Nobakhtian, S., (2008)
- More ...