Minimum cost partitions of a rectangle

Research output: Contribution to journalArticlepeer-review


We consider the problem of partitioning (in a certain manner) a rectangle into n regions of equal area so that the total lengths of the boundaries is a minimum. A closed form solution to the problem is presented.

Original languageEnglish (US)
Pages (from-to)305-324
Number of pages20
JournalDiscrete Mathematics
Issue number3
StatePublished - 1981

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Minimum cost partitions of a rectangle'. Together they form a unique fingerprint.

Cite this