New Classes of Lower Bounds for Bin Packing Problems-Reference-Cited by-同舟云学术

New Classes of Lower Bounds for Bin Packing Problems

Published:1998 Issue: Volume: Page:257-270
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Fekete Sándor P.,Schepers Jörg

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-69346-7_20

Reference18 articles.

1. J. E. Beasley. OR-Library: Distributing test problems by electronic mail. Journal of Operations Research Society, 41:1069–1072, 1990. http://mscmga.ms.ic.ac.uk/info.html

2. E. G. Coffmann, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, pages 46–93. PWS Publishing, Boston, 1997.

3. E. G. Coffmann, Jr. and G. S. Lueker. Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York, 1991.

4. Lect Notes Comput Sci;S. P. Fekete,1997

5. S. P. Fekete and J. Schepers. On more-dimensional packing I: Modeling. ZPR Technical Report 97-288. http://www.zpr.uni-koeln.de

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. New Effective Data Structure for Multidimensional Optimization Orthogonal Packing Problems;Advances in Mechanical Engineering;2016

2. TECHNOLOGIES OF MODELING OF ALGORITHMS OF ORTHOGONAL CUTTING PACKING AND GEOMETRICAL COVERING: EFFICIENCY COMPARISON;Oil and Gas Business;2015-10

3. Two-Dimensional Bin Packing Problems;Paradigms of Combinatorial Optimization;2014-08-08

4. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08

5. Multilevel Linked Data Structure for the Multidimensional Orthogonal Packing Problem;Applied Mechanics and Materials;2014-07