| Article ID: | iaor20106137 |
| Volume: | 179 |
| Issue: | 1 |
| Start Page Number: | 5 |
| End Page Number: | 14 |
| Publication Date: | Sep 2010 |
| Journal: | Annals of Operations Research |
| Authors: | Martello Silvano, Iori Manuel, Fernandes Muritiba Albert E, Negreiros Gomes Marcos J |
| Keywords: | retailing, programming: linear |
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).