| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1032817 | Omega | 2013 | 10 Pages |
Abstract
⺠We analyse a partitioning problem where groups have to be as diverse as possible. ⺠We present different applications of the abstract problem. ⺠We propose different linear programming formulations and an exact solution scheme. ⺠We derive tight upper and lower bounds that considerably improve the formulations. ⺠The solvable problem sizes are increased by more than one order of magnitude.
Related Topics
Social Sciences and Humanities
Business, Management and Accounting
Strategy and Management
Authors
Elena Fernández, Jörg Kalcsics, Stefan Nickel,