Monique Guignard-Spielberg

Learn More
We apply the level-3 Reformulation Linearization Technique (RLT3) to the Quadratic Assignment Problem (QAP). We then present our experience in calculating lower bounds using an essentially new algorithm, based on this RLT3 formulation. This algorithm is not guaranteed to calculate the RLT3 lower bound exactly, but approximates it very closely and reaches it(More)
This paper reports on a new algorithm for the Generalized Quadratic Assignment problem (GQAP). The GQAP describes a broad class of quadratic integer programming problems, wherein M pairwise related entities are assigned to N destinations constrained by the destinations’ ability to accommodate them. This new algorithm is based on a Reformulation(More)
Vehicles with multiple compartments are used, among others, for distribution to convenience stores. Based on the convenience stores paradigm we propose optimization models for two possible cargo space layouts and explore their characteristics through computational experiments with randomly generated data sets. In a small real data set an optimal solution of(More)
This paper should be of interest to the combinatorial optimization community and especially to those interested in the Quadratic Assignment Problem (QAP). The QAP has application in the assignment of facilities to locations (to minimize the cost of intrafacility transportation), the placement of electronic components (to minimize the length of(More)
We report on a growing class of assignment problems that are increasingly of interest and very challenging in terms of the difficulty they pose to attempts at exact solution. These problems address economic issues in the location and design of factories, hospitals, depots, transportation hubs and military bases. Others involve improvements in communication(More)