| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651662 | Electronic Notes in Discrete Mathematics | 2015 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
