.png){kind=icon}
返回
Models and algorithms for fair layout optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0451-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a non-convex two-dimensional area and identical rectangular stands, we consider the problem of placing the maximum number of stands in the area, by satisfying a number of operational constraints. We present linear programming models and show the total unimodularity of the matrices associated with their constraint sets. We then give computational results obtained by applying the models to the real-world case of the Beira Mar handcraft fair of Fortaleza (Brazil).
Keyword:
Two-dimensional packing
Space allocation
Fair layout
Mathematical model
Total unimodularity
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
查看更多机构
引用论文
.png){kind=icon}
<title>AIRS science processing system (ASPS): a description of architecture and capabilities</title>
PREAI
分享收藏