[1] Wascher G, Hauner H, Schumann H. An improved typology of cutting and packing problems[J]. European Journal of Operational Research, 2007, 183(3): 1109-1130. [2] Zhu W B, Zhang Z Y, Oon W C, Lim A. Space defragmentation for packing problems[J]. European Journal of Operational Research, 2012, 222(3): 452-462. [3] Lin Y H, Lin C, Lin B. On conflict and cooperation in a two-echelon inventory model for deteriorating items[J]. Computers & Industrial Engineering, 2010, 59(4): 703-711. [4] Jansen K. An approximation scheme for bin packing with conflicts[J]. Journal of Combinational Optimization, 1999, 3(4): 363-377. [5] Gendreau M, Laporte G, Semet F. Heuristics and lower bounds for the bin packing problem with conflicts[J]. Computers & Operations Research, 2004, 31(3): 347-358. [6] Muritiba A E F, Iori M, Malaguti E, Toth P. Algorithms for the bin packing problem with conflicts[J]. INFORMS Journal on Computing, 2010, 22(3): 401-415. [7] Khanafer A, Clautiaux F, Talbi E. New lower bounds for bin packing problems with conflicts[J]. European Journal of Operational Research, 2010, 206(2): 281-288. [8] Elhedhli S, Li L Z, Gzara M, Naoum-sawaya J. A branch-and-price algorithm for the bin packing problem with conflicts[J]. INFORMS Journal on Computing, 2011, 22(3): 404-415. [9] Galinier P, Hertz A. A survey of local search methods for graph coloring[J]. Computers & Operations Research, 2006, 33(9): 2547-2562. [10] Balogh J, Butterfield J. Excluding induced subgraphs: critical graphs[J]. Random Structures & Algorithms, 2011, 38(1-2): 100-120. [11] Balogh J, Békési J, Galambos G. New lower bounds for certain classes for bin packing algorithms[J]. Theoretical Computer Science, 2012, 440-441: 1-13. [12] Gogos C, Alefragis P, Housos E. An improved multi-staged algorithmic process for the solution of the examination timetabling problem[J]. Annals of Operations Research, 2012, 194(1): 203-221. [13] 潘全,郭鸣,林鹏.基于MapReduce的最大团算法[J].系统工程理论与实践,2011,31(S2):150-153. [14] Chen Q, Fadlullah Z M, Lin X D, Kato N. A clique-based secure admission control scheme for mobile adhoc networks(MANETs)[J]. Journal of Network and Computer Applications, 2011, 34(6): 1827-1835. [15] Dang D C, Moukrim A. Subgraph extraction and metaheuristics for the maximum clique problem[J]. Journal of Heuristics, 2012, 18(5): 767-794. [16] Elhedhli S. Ranking lower bounds for the bin-packing problem[J]. European Journal of Operational Research, 2005, 160(1): 34-46. [17] Galinier P, Hertz A. A survey of local search methods for graph coloring[J]. Computers and Operations Research, 2006, 33(9): 2547-2562. |