A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation
[chapter]
2012
Lecture Notes in Computer Science
The minimum stabbing triangulation of a set of points in the plane (mstr) was previously investigated in the literature. The complexity of the mstr remains open and, to our knowledge, no exact algorithm was proposed and no computational results were reported earlier in the literature of the problem. This paper presents integer programming (ip) formulations for the mstr, that allow us to solve it exactly through ip branch-and-bound (b&b) algorithms. Moreover, one of these models is the basis for
doi:10.1007/978-3-642-32147-4_5
fatcat:syy6jyqnyneqfoqkcpdnv5d3mm