Fast equi-partitioning of rectangular domains using stripe decomposition

DOI10.1016/S0166-218X(97)00122-4zbMath0897.90160OpenAlexW2082928800MaRDI QIDQ1383377

Wayne Martin

Publication date: 13 April 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

quadratic assignmentgrid partitioningnear-optimal solutions\(k\)-way graph partitionknapsack integer programminimum perimeter problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27)

Related Items (1)

A survey for the quadratic assignment problem

Uses Software

• MESHPART

Cites Work

• Minimum-perimeter domain assignment
• Optimal equi-partition of rectangular domains for parallel computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast equi-partitioning of rectangular domains using stripe decomposition