Optimal placement of rectangles on a plane with fixed objects


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Consider a region on a plane with a set of points with positive weights and rectangles that have to be place in that region without intersections. Either the maximal sum of weights of the points in rectangles or the total sum must be minimal. We consider the case of two rectangles. The original continuous problem is reduced to a discrete one by introducing equivalence classes. We propose polynomial combinatorial algorithms for solving the problem. We conduct a computational experiment to compare the efficiency of developed algorithms with the IBM ILOG CPLEX suite with an integer programming model.

作者简介

G. Zabudskii

Sobolev Institute of Mathematics, Siberian Branch

编辑信件的主要联系方式.
Email: zabudsky@ofim.oscsbras.ru
俄罗斯联邦, Novosibirsk

T. Keiner

Dostoevsky Omsk State University

Email: zabudsky@ofim.oscsbras.ru
俄罗斯联邦, Omsk

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017