A convex hull algorithm for solving a location problem
Year of publication: |
July/September 2015
|
---|---|
Authors: | Nguyen Kieu Linh ; Le Dung Muu |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 49.2015, 3, p. 589-600
|
Subject: | Location problem | distance geometry | convex hull | Quick-hull algorithm | subgradient method | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Standorttheorie | Location theory |
-
Discrete location problems with flexible objectives
Velten, Sebastian, (2009)
-
A new algorithm for solving planar multiobjective location problems involving the Manhattan norm
Alzorba, Shaghaf, (2017)
-
An Approximation Algorithm for a Competitive Facility Location Problem with Network Effects
Kung, Ling-Chieh, (2018)
- More ...
-
On DC optimization algorithms for solving minmax flow problems
Le Dung Muu, (2014)
-
On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
Le Dung Muu, (2008)
-
A subgradient method for equilibrium problems involving quasiconvex bifunctions
Le Hai Yen, (2020)
- More ...