Based on sequential convex programming, we introduce an approximate algorithm for solving efficiently the problem of minimizing a sum of Euclidean norms on the boundaries of convex polygons in 3D. Numerical tests are shown and some applications in facilities location area are discussed. |