Partitions of Rectilinear Polygons with Minimum Stabbing Number

We study integer programming models for the problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number. Polyhedral investigations and computational tests are reported for the first time for the problem.