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...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 329; no. 3; pp. 767 - 777
Main Authors:	Hernández-Pérez, Hipólito, Riera-Ledesma, Jorge, Rodríguez-Martín, Inmaculada, Salazar-González, Juan-José
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.03.2026
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!