Models and algorithms for fair layout optimization problems

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 w...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2010-09, Vol.179 (1), p.5-14
Main Authors: Fernandes Muritiba, Albert E., Iori, Manuel, Martello, Silvano, Negreiros Gomes, Marcos J.
Format: Article
Language:English
Subjects:
Algorithms
Alliances
Analysis
Brazil
Business and Management
Combinatorics
Fairs & exhibitions
Layouts
Linear programming
Mathematical analysis
Mathematical models
Operations research
Operations Research/Decision Theory
Optimization
Placing
Stands
Studies
Supports
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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).
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-008-0451-x