Rafael Blanquero Bravo , Emilio Carrizosa Priego
In this talk we address the problem of locating in the plane objects such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries. Given a set of points, we seek the rotation and translation for such an object optimizing a very general performance measure, which includes as a particular case the classical objectives in semi-obnoxious facility location.
In general, the abovementioned model yields a Global Optimization problem. We represent it as a DC program for which a covering method is used.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados