On a 2-dimensional equipartition problem

On a 2-dimensional equipartition problem

0.00 Avg rating0 Votes
Article ID: iaor20001717
Country: Netherlands
Volume: 113
Issue: 1
Start Page Number: 215
End Page Number: 231
Publication Date: Feb 1999
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: heuristics
Abstract:

The present paper deals with the following problem, which arises in a variety of applications: given a node-weighted rectangular grid graph, perform p horizontal full cuts and q vertical ones so as to make the weights of the resulting (p+1)(q+1) rectangular subgrids ‚as close as possible’. Computational complexity aspects are discussed. Several heuristic algorithms for obtaining partitions which minimize the maximum weight of a subgrid are developed, and computational results are reported. Theoretical bounds on the approximation error are also given.

Reviews

Required fields are marked *. Your email address will not be published.