The table placement problem: a research challenge at the EWI 2007
Tóm tắt
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.
Tài liệu tham khảo
Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs
Baker BM, Benn C (2001) Assigning pupils to tutor groups in a comprehensive school. J Oper Res Soc 52:623–629
Baker KR, Powell SG (2002) Methods for assigning students to groups: A study of alternative objective functions. J Oper Res Soc 53:397–404
Beheshtian-Ardekani M, Mahmood MA (1986) Development and validation of a tool for assigning students to groups for class projects. Decis Sci 17:92–113
Burkard R, Dell’Amico M, Martello S (2009) Assignment problems. SIAM, Philadelphia
Desrosiers J, Mladenovic N, Villeneuve D (2005) Design of balanced MBA student teams. J Oper Res Soc 56:60–66
Fernandes-Muritiba AE, Iori M, Malaguti E, Toth P (2010) Algorithms for the bin packing problem with conflicts. INFORMS J Comput 22:401–415
Fourer R (1997) “Balanced” assignment. Available online at http://www.ampl.com/CASES/balassign.html
Hartsfield N, Ringel G (1994) Pearls in graph theory. A comprehensive introduction. Academic Press, San Diego
Jansen K (1999) An approximation scheme for bin packing with conflicts. J Comb Optim 3:363–379
Krass D, Ovchinnikov A (2006) The University of Toronto’s Rotman School of Management uses management science to create MBA study group. Interfaces 36(2):126–137
Mingers J, O’Brien FA (1995) Creating student groups with similar characteristics: a heuristic approach. Omega 23(3):313–321
O’Brien FA, Mingers J (1997) A heuristic algorithm for the equitable partitioning problem. Omega 25(2):215–223
Plastria F (2002) Formulating logical implications in combinatorial optimisation. Eur J Oper Res 140:338–353
Plastria F (2006) Table placement, an OR problem? MOSI Working Paper 39
Sørensen MM (2004) New facets and a branch-and-cut algorithm for the weighted clique problem. Eur J Oper Res 154:57–70
Weitz RR, Jelassi MT (1992) Assigning students to groups: a multi-criteria decision support system approach. Decis Sci 23(3):746–757
Weitz RR, Lakshminarayanan S (1998) An empirical comparison of heuristic methods for creating maximally diverse groups. J Oper Res Soc 49:635–646