Probabilistic Analysis of Algorithms for Dual Bin Packing Problems
暂无分享,去创建一个
J. B. G. Frenk | Alexander H. G. Rinnooy Kan | János Csirik | Gábor Galambos | A. Kan | J. Csirik | J. Frenk | G. Galambos
[1] Walter Knödel,et al. A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit , 1981, MFCS.
[2] Susan Fera. Assmann. Problems in discrete applied mathematics , 1983 .
[3] G. S. Lueker. An average-case analysis of bin packing with uniformly distributed item sizes , 1982 .
[4] Kai Lai Chung,et al. A Course in Probability Theory , 1949 .
[5] Antoine-S Bailly,et al. Science régionale - Walter Isard, Introduction to régional science. Englewood Cliffs (NJ), Prentice-Hall, 1975 , 1975 .
[6] Jbg Hans Frenk. On a pairing heuristic in binpacking , 1986 .
[7] Joseph Y.-T. Leung,et al. On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.
[8] Jbg Hans Frenk. On banach algebras, renewal measures and regenerative processes , 1987 .
[9] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[10] Jozef Gruska,et al. Mathematical Foundations of Computer Science 1981 , 1981, Lecture Notes in Computer Science.
[11] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .