A simple heuristic for the optimal enclosed area polygon problem
1996
Abstract
We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area.
Details
Title
A simple heuristic for the optimal enclosed area polygon problem
Author(s)
Hêche, J.-F. ; Liebling, Th. M.
Published in
CEJORE
Volume
4
Issue
2-3
Pages
155-166
Date
1996
Note
PRO 96.13
Laboratories
ROSO
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > SB Archives > ROSO - Chair of Operations Research SO
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Peer-reviewed publications
Work produced at EPFL
Journal Articles
Published
Record creation date
2006-02-13