Bin packing with directed stackability conflicts

[1] J. Balogh, J. Békési, Gy. Dósa, L. Epstein, H. Kellerer, Zs. Tuza, Online results for black and white bin packing, Theory Comput. Syst., 56, 1 (2015) 137–155. ⇒3410.1007/s00224-014-9538-8Search in Google Scholar

[2] N. Bansal, Z. Liu, A. Sankar, Bin-packing with fragile objects and frequency allocation in cellular networks, Wireless Networks, 15, 6 (2009) 821–830. ⇒3310.1007/s11276-007-0081-2Search in Google Scholar

[3] M. Böhm, J. Sgall, P. Vesely, Online colored bin packing, arXiv:1404.5548 [cs.DS] (2014) ⇒3410.1007/978-3-319-18263-6_4Search in Google Scholar

[4] F. Clautiaux, M. Dell’Amico, M. Iori, A. Khanafer, Lower and upper bounds for the Bin Packing Problem with Fragile Objects, Discrete Appl. Math., 163, 1 (2014) 73–86. ⇒3310.1016/j.dam.2012.04.010Search in Google Scholar

5] Jr., E. G. Coffman, C. Courcoubetis, M. R. Garey, D. S. Johnson, P. W. Shor, R. R. Weber, M. Yannakakis, Bin packing with discrete item sizes part I: Perfect packing theorems and the average case behavior of optimal packings, SIAM J. Discrete Math., 13, 3 (2000) 384–402 ⇒4510.1137/S0895480197325936Search in Google Scholar

[6] Jr., E. G. Coffman, D. S. Johnson, L. A. McGeoch, R. R. Weber, Bin packing with discrete item sizes part II: tight bounds on First Fit, Random Structures Algorithms, 10, 1–2 (1997) 69–101. ⇒4510.1002/(SICI)1098-2418(199701/03)10:1/2<69::AID-RSA4>3.0.CO;2-VSearch in Google Scholar

[7] Gy. Dósa, L. Epstein, Colorful bin packing, Algorithm Theory – SWAT 2014, Lecture Notes in Comput. Sci., 8503 (2014) 170–181. ⇒3410.1007/978-3-319-08404-6_15Search in Google Scholar

[8] Gy. Dósa, J. Sgall, First Fit bin packing: a tight analysis, 30th International Symposium on Theoretical Aspects of Computer Science: STACS, Dagstuhl, Germany, 2013, pp. 538–549. ⇒47Search in Google Scholar

[9] Gy. Dósa, Zs. Tuza, D. Ye, Bin packing with ’Largest In Bottom’ constraint: tighter bounds and generalizations, J. Comb. Optim., 26, 3 (2013) 416–436. ⇒3410.1007/s10878-011-9408-0Search in Google Scholar

[10] L. Epstein, On online bin packing with LIB Constraints, Naval Res. Logist., 56, 8 (2009) 780–786. ⇒3410.1002/nav.20383Search in Google Scholar

[11] L. Epstein, Cs. Imreh, A. Levin, Class constrained bin packing revisited, Theoret. Comput. Sci., 411, 34–36 (2010) 3073–3089. ⇒3310.1016/j.tcs.2010.04.037Search in Google Scholar

[12] L. Epstein, A. Levin, On bin packing with conflicts, Approximation and Online Algorithms, Lecture Notes in Comput. Sci.4368 (2007) 160–731. ⇒3410.1007/11970125_13Search in Google Scholar

[13] K. Jansen, An approximation scheme for bin packing with conflicts, J. Comb. Optim., 3, 4 (1999) 363–377. ⇒34Search in Google Scholar

[14] K. Jansen, S. Öhring, Approximation algorithms for time constrained scheduling, Inform. and Comput., 132, 2 (1997) 85–108. ⇒3410.1006/inco.1996.2616Search in Google Scholar

[15] A. Khanafer, F. Clautiaux, E. G. Talbi, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Computers and Operations Research, 39, 1 (2012) 54–63. ⇒3410.1016/j.cor.2010.07.009Search in Google Scholar

[16] P. Manyem, Uniform sized bin packing and covering: Online version, Topics in industrial mathematics, Springer US, 2000. ⇒34Search in Google Scholar

[17] P. Manyem, R. L. Salt, M. S. Visser, Approximation lower bounds in online LIB bin packing and covering, J. Autom. Lang. Comb., 8, 4 (2003) 663–674 ⇒34Search in Google Scholar

[18] S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementations, John Wiley and Sons, 1990. ⇒36Search in Google Scholar

[19] B. McCloskey, A. Shankar, Approaches to bin packing with clique-graph conflicts, EECS Department, University of California, Berkeley (2005) ⇒34Search in Google Scholar

[20] R. Sadykov, F. Vanderbeck, Bin packing with conflicts: a generic branch-and-price algorithm, INFORMS J. Comput., 25, 2 (2013) 244–255. ⇒3410.1287/ijoc.1120.0499Search in Google Scholar

[21] H. Shachnai, T. Tamir, Tight bounds for online class-constrained packing, Theoret. Comput. Sci., 321, 1 (2004) 103–123. ⇒33, 4510.1016/j.tcs.2003.05.006Search in Google Scholar

[22] H. Shachnai, T. Tamir, Polynomial time approximation schemes for class-constrained packing problems, Journal of Scheduling, 4, 6 (2001) 313–338. ⇒3310.1002/jos.86Search in Google Scholar

[23] H. Shachnai, T. Tamir, On two class-constrained versions of the multiple knapsack problem, Algorithmica, 29, 3 (2001) 442–467. ⇒3310.1007/s004530010057Search in Google Scholar

[24] K. Thulasiraman, M. N. S. Swamy, 5.7 Acyclic Directed Graphs, Graphs: Theory and Algorithms, John Wiley and Sons, 1992. 118. ⇒4310.1002/9781118033104Search in Google Scholar

[25] J. D. Ullman, The performance of a memory allocation algorithm., Princeton University, Department of Electrical Engineering, Computer Science Laboratory, (1971) ⇒47Search in Google Scholar

[26] E. C. Xavier, F. K. Miyazawa, The class constrained bin packing problem with applications to video-on-demand, Theoret. Comput. Sci., 393, 1–3 (2008) 240–259. ⇒33Search in Google Scholar