1. Aardal KI, van Hoesel CPM, Koster AMCA, Mannino C, Sassano A (2001) Models and solution techniques for the frequency assignment problem. ZIB-report 01–40, Berlin
2. Fernandes Muritiba AE, Iori M, Malaguti E, Toth P (2006) Lower and upper bounds for the bin packing problem with conflicts. Technical Report OR/06/7, DEIS, University of Bologna
3. Finke G, Jost V, Queyranne M, Sebö A (2004) Batch processing with interval graph compatibilities between tasks. Cahiers du laboratoire Leibniz, 108
4. Gendreau M, Laporte G and Semet F (2004). Heuristics and lower bounds for the bin packing problem with conflicts. Comput Oper Res 31: 347–358
5. Lodi A, Malaguti E, Stier Moses N (2008) Efficient and fair routing for ad hoc wireless telecommunication networks. Technical Report OR/08/1, DEIS, University of Bologna