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. © 2015 Elsevier B.V.50 267273Couto, M.C., de Rezende, P.J., de Souza, C.C., Instances for the Art Gallery Problem, , https://www.ic.unicamp.br/~cid/Problem-instances/Art-Galleryde Meneses, C.N., de Souza, C.C., Exact solutions of rectangular partitions via integer programming (2000) Int. J. Comp. Geom. & Appl., 10, pp. 477-522Durocher, S., Mehrabi, S., Computing partitions of rectilinear polygons with minimum stabbing number , pp. 228-239. , LNCS 7434 (COCOON 2012)Fekete, S.P., Lübbecke, M.E., Meijer, H., Minimizing the stabbing number of matchings, trees, and triangulations (2008) Disc. Comp. Geom., 40, pp. 595-621