The table placement problem consists in deciding how to seat the participants attending a social lunch or dinner so that the total social benefit of the event is maximum. Four different approaches are presented: a linear model, a bin-packing-based-approach, a quadratic assignment problem, and a greedy heuristic. The different formulations are computationally compared over a set of artificial instances and on the real data for the EURO Winter Institute 2007 Gala dinner.
Sergio García, Valentina Cacchiani, Lieselot Vanhaverbeke, Martin Bischoff (2014). The table placement problem: a research challenge at the EWI 2007. TOP, 22(1), 208-226 [10.1007/s11750-012-0249-5].
The table placement problem: a research challenge at the EWI 2007
CACCHIANI, VALENTINA;
2014
Abstract
The table placement problem consists in deciding how to seat the participants attending a social lunch or dinner so that the total social benefit of the event is maximum. Four different approaches are presented: a linear model, a bin-packing-based-approach, a quadratic assignment problem, and a greedy heuristic. The different formulations are computationally compared over a set of artificial instances and on the real data for the EURO Winter Institute 2007 Gala dinner.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
