Optimal area polygonisation problems: mixed integer linear programming models

DOI10.1016/J.EJOR.2025.08.023MaRDI QIDQ6852421zbMATH OpenFDO

Authors Hipólito Hernández-Pérez, Jorge Riera-Ledesma, Inmaculada Rodríguez-Martín, Juan-José Salazar-González

Publication date 26 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.08.023

zbMATH Keywords

computational geometrymixed integer linear programmingpolygonisationstravelling salesman problemtriangulations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• 2-opt moves and flips for area-optimal polygonizations
• Area optimal polygonization using simulated annealing
• Area-optimal simple polygonalizations: the CG challenge 2019
• Cardinality constrained minimum cut problems: complexity and algorithms.
• Computing area-optimal simple polygonizations
• Greedy and local search heuristics to build area-optimal polygons
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• Minimal Triangulations of Polygonal Domains
• Minimum-weight triangulation is NP-hard
• On a linear program for minimum-weight triangulation
• On simple polygonalizations with optimal area
• Optimal area polygonization problems: exact solutions through geometric duality
• Solving the minimum convex partition of point sets with integer programming
• The Euclidean traveling salesman problem is NP-complete
• The precedence-constrained asymmetric traveling salesman polytope
• Triangle-Based Heuristics for Area Optimal Polygonizations
• Triangulations (tilings) and certain block triangular matrices

This page was built for publication: Optimal area polygonisation problems: mixed integer linear programming models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852421)