A primal algorithm for the weighted minimum covering ball problem in Rn
Year of publication: |
July 2016
|
---|---|
Authors: | Dearing, P. M. ; Belotti, Pietro ; Smith, Andrea M. |
Published in: |
Top : transactions in operations research. - [Berlin] : Springer, ISSN 1134-5764, ZDB-ID 1205918-3. - Vol. 24.2016, 2, p. 466-492
|
Subject: | Minimum covering ball | One-center location | Min-max location | Nonlinear programming | Voronoi diagram | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Betriebliche Standortwahl | Firm location choice | Nichtlineare Optimierung | Standorttheorie | Location theory |
-
A new mathematical model for the Weber location problem with a probabilistic polyhedral barrier
Amiri-Aref, Mehdi, (2013)
-
Sequential competitive facility location : exact and approximate algorithms
Qi, Mingyao, (2024)
-
Two-level capacitated discrete location with concave costs
Malik, Aditya, (2022)
- More ...
-
A dual algorithm for the minimum covering weighted ball problem in $${\mathbb{R}^n}$$
Dearing, P. M., (2013)
-
Bound reduction using pairs of linear inequalities
Belotti, Pietro, (2013)
-
Optimizing base station location and configuration in UMTS networks
Amaldi, Edoardo, (2006)
- More ...