Optimal placement of rectangles on a plane with fixed objects
- 作者: Zabudskii G.G.1, Keiner T.I.2
-
隶属关系:
- Sobolev Institute of Mathematics, Siberian Branch
- Dostoevsky Omsk State University
- 期: 卷 78, 编号 9 (2017)
- 页面: 1651-1661
- 栏目: Optimization, System Analysis, and Operations Research
- URL: https://journals.rcsi.science/0005-1179/article/view/150684
- DOI: https://doi.org/10.1134/S0005117917090090
- ID: 150684
如何引用文章
详细
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
补充文件
