Skip to main content
Have a personal or library account? Click to login
An experimental comparison of some heuristics for cardinality constrained bin packing problem Cover

An experimental comparison of some heuristics for cardinality constrained bin packing problem

Business Systems Research Journal
Volume 3 (2012): Issue 2 (September 2012)
By: ,   and    
Open Access
|Sep 2012
References

References

  1. Coffman, E. G, Garey, M. R, Johnson, D. S. (1997), "Approximation algorithms for binpacking: A survey", in Hochbaum, D. (Ed.), Approximation Algorithms for NPHard Problems, PWS, Boston, pp. 4693.
    Search in Google Scholar
  2. Kellerer, H, Pferschy, U. (1999), "Cardinality constrained bin-packing problems", Annals of Operations Research, Vol. 92, No. 0, pp. 335-348.
    Open DOISearch in Google Scholar
  3. Korte, B, Vygen, J. (2000), Combinatorial Optimization, Theory and Algorithms, Berlin, Springer.
    Open DOISearch in Google Scholar
  4. Krause, K. L, Shen, V. Y, Schwetman, H. D. (1975), "Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems", Journal of ACM, Vol. 22, No. 4, pp. 522-550.
    Open DOISearch in Google Scholar
  5. Milnes, A. G. (2002), "Guide to the documentation of 25 year of geoscientific research (1976-2000)", Technical Report, No. 02-18, Swedish Nuclear Fuel and Waste Management Co., Sweden, Stockholm, March 2002.
    Search in Google Scholar
  6. Yao, A. C. (1980), "New algorithms for bin packing", Journal of the ACM, Vol. 27, No. 2, pp. 207-227.
    Open DOISearch in Google Scholar
  7. Zhang, G, Cai, X, Wong, C. K. (2000), "Lineartimeapproximation algorithms for bin packing", Operations Research Letters, Vol. 26, No. 5, pp. 217222.
    Search in Google Scholar
  8. Železnik, N, et al. (2004), "Program razgradnje NEK in odlaganja NSRAO in IJG" ("Program of NPP Krško Decommissioning and SF & LILW Disposal"), Study, No. T-1123-03, Agency for Radwaste Management, Ljubljana, Slovenia, and Agency for Hazardous Waste, Zagreb, Croatia.
    Search in Google Scholar
  9. Žerovnik, G, Snoj, L, Ravnik, M. (2009), "Optimization of Spent Nuclear Fuel Filling in Canisters for Deep Repository", Nuclear Science and Engineering, Vol. 163, No. 2, pp. 183-190.
    Open DOISearch in Google Scholar
  10. Žerovnik, G, Žerovnik, J. (2011), "Constructive heuristics for the canister filling problem", Central European Journal of Operations Research, Vol. 19, No. 3, pp. 371-389.
    Open DOISearch in Google Scholar
DOI: https://doi.org/10.2478/v10305-012-0013-1 | Journal eISSN: 1847-9375 | Journal ISSN: 1847-8344
Journal RSS Feed
Language: English
Page range: 57 - 63
Published on: Sep 19, 2012
Published by: IRENET - Society for Advancing Innovation and Research in Economy
In partnership with: Paradigm Publishing Services
Keywords:
cardinality constrained bin packing problem heuristics,
approximation algorithm
Related subjects:
Business and economics,
Business management,
Business management, other

© 2012 Maja Remic, Gašper Žerovnik, Janez Žerovnik, published by IRENET - Society for Advancing Innovation and Research in Economy
This work is licensed under the Creative Commons License.

Volume 3 (2012): Issue 2 (September 2012)
Previous article