Optimal area polygonisation problems: Mixed integer linear programming models

This paper describes approaches to finding polygons with maximum and minimum area through a given set of points on the Euclidean plane. Both problems are NP-hard and of interest in Computational Geometry. They have been extensively studied, although only the recent literature presents mathematical f...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research
Hauptverfasser:	Hernández-Pérez, Hipólito, Riera-Ledesma, Jorge, Rodríguez-Martín, Inmaculada, Salazar-González, Juan-José
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.09.2025
Schlagworte:	Computational geometry Mixed integer linear programming Polygonisations Travelling Salesman problem Triangulations Computational geometry Triangulations Mixed integer linear programming Polygonisations Travelling Salesman problem
ISSN:	0377-2217
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!