Name
Abstract | ||
|---|---|---|
Flying Elephants (FE) is a generalization and a new interpretation of the Hyperbolic Smoothing approach. The article introduces the fundamental smoothing procedures. It contains a general overview of successful applications of the approach for solving a select set of five important problems, namely: distance geometry, covering, clustering, Fermat---Weber and hub location. For each problem the original non-smooth formulation and the succedaneous completely differentiable one are presented. Computational experiments for all related problems obtained results that exhibited a high level of performance according to all criteria: consistency, robustness and efficiency. For each problem some results to illustrate the performance of FE are also presented. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s10732-014-9268-8 | J. Heuristics |
Keywords | Field | DocType |
Non-differentiable optimization,Smoothing,Distance geometry,Covering,Clustering,Fermat–Weber problem,Hub location problem | Mathematical optimization,Robustness (computer science),Differentiable function,Smoothing,Distance geometry,Cluster analysis,Hub location problem,Mathematics | Journal |
Volume | Issue | ISSN |
22 | 4 | 1381-1231 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adilson Xavier | 1 | 45 | 6.28 |
| Vinicius Layter Xavier | 2 | 13 | 2.01 |