Return
Optimal area polygonisation problems: Mixed integer linear programming models
DOI:10.1016/j.ejor.2025.08.023.png)
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
IF:
6
Papers:
2.2W
Citations:
8.1W
Organization
No organization information available

