Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Recognizing integrality of weighted rectangles partitions

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年1月20日

查看全文
  • Paul Deuker,
  • Ulf Friedrich

摘要

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.