Answers are grounded in this paper and cite their sources.
Given a grid of active and inactive pixels, the weighted rectangles partitioning (WRP) problem is to find a maximum-weight partition of the active pixels into rectangles. WRP is formulated as an integer programming problem and instances with an integral relaxation polyhedron are characterized by a balanced problem matrix. A complete characterization of these balanced instances is proved. In addition, computational results on balancedness recognition and on solving WRP are presented.
No takes yet. Share an insight, caveat, or question.
Deuker et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: