.png){kind=icon}
Return
Models and algorithms for fair layout optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0451-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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).
Keywords:
Two-dimensional packing
Space allocation
Fair layout
Mathematical model
Total unimodularity
Journal
IF:
4.5
Papers:
8.1K
Citations:
2.1W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSave<title>AIRS science processing system (ASPS): a description of architecture and capabilities</title>
PREAI
ShareSave