arrow
Return

Optimal area polygonisation problems: Mixed integer linear programming models

delete2025-09-06
delete0
delete
OA
AI
H
Hipólito Hernández–Pérez
J
Jorge Riera‐Ledesma
I
Inmaculada Rodrı́guez-Martı́n
J
Juan‐José Salazar‐González *
DOI:10.1016/j.ejor.2025.08.023delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
• Finding a permutation of given points in the plane to optimise the interior area. • Mixed Integer Linear Programming formulations in Computational Geometry. • Triangulating a point set to solve a variant of the Travelling Salesman Problem.
Keywords:
Computational geometry
Triangulations
Polygonisations
Mixed integer linear programming
Travelling Salesman problem

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
8.1W

Organization

No organization information available
Cited Papers

Cited Papers

Triangle-Based Heuristics for Area Optimal Polygonizations
err2022-05-25
err0
PREAI
errNatanael Ramos; Raí C. de Jesus; Pedro J. de Rezende; Cid C. de Souza; Fbio L. Usberti
errShare
errSave
errShare
errSave
Optimal area polygonization problems: Exact solutions through geometric duality
err2022-09-01
err0
PREAI
errRamos, Natanael; de Rezende, Pedro J.; de Souza, Cid C.
errShare
errSave
Solving the minimum convex partition of point sets with integer programming
err2021-12-01
err0
errOAAI
errAllan Sapucaia; Pedro J. de Rezende; Cid C. de Souza
errShare
errSave
Minimum-weight triangulation is NP-hard
err2008-05-15
err0
errOAAI
errWolfgang Mulzer; Günter Rote
errShare
errSave
researcher View more