Please use this identifier to cite or link to this item: http://openarchive.nure.ua/handle/document/2058
Title: Integer Linear Programming Models for the Problem of Covering a Polygonal Region by Rectangles
Authors: Scheithauer, G.
Stoyan, Yu.
Romanova, T.
Keywords: optimization
mathematical modelling
integer linear programming
covering
Issue Date: 2009
Publisher: ХНУРЭ
Citation: Scheithaue, G. Integer Linear Programming Models for the Problem of Covering a Polygonal Region by Rectangles / G. Scheithau, Yu. Stoyan, T. Romanova // Радиоэлектроника и информатика : науч.-техн. журн. – Х. : Изд-во ХНУРЭ, 2009. – Вып. 2. – С. 4-13.
Abstract: The aim of the paper is to develop integer linear programming (ILP) models for the problem of covering a polygonal region by rectangles. We formulate a Beasley-type model in which the number of variables depends on the size parameters. Another ILP model is proposed which has O(n2 max{m, n}) variables where m is the number of edges of the target set and n is the number of given rectangles. In particular we consider the case where the polygonal region is convex. Extensions are also discussed where we allow the polygonal region to be a union of a finite number of convex subsets.
URI: http://openarchive.nure.ua/handle/document/2058
Appears in Collections:Радиоэлектроника и информатика

Files in This Item:
File Description SizeFormat 
RI_2009_2-004-013.pdf410.44 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.