A bin packing problem with over-sized items-Reference-Cited by-同舟云学术

A bin packing problem with over-sized items

Published:2002-04 Issue:2 Volume:30 Page:83-88
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Xing Wenxun

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference6 articles.

1. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing problems: an updated survey, in: Ausiello, Lucer-tini (Eds.), Analysis and Design of Algorithms in Combinatorial Optimization, Springer, New York, 1984, pp. 49–106.

2. Variable-sized bin packing;Friesen;SIAM J. Comput.,1986

3. On-line bin packing—a restricted survey;Galambos;ZOR-Math. Methods Oper. Res.,1995

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. Worst-case performance bounds for simple one-dimensional packing algorithms;Johnson;SIAM J. Comput.,1974

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

1. Online algorithms for 2D bin packing with advice;Neurocomputing;2016-05

2. 2-space bounded online cube and hypercube packing;Tsinghua Science and Technology;2015-06

3. On the Advice Complexity of One-Dimensional Online Bin Packing;Frontiers in Algorithmics;2014

4. A Parallel Algorithm for 2D Square Packing;2013 International Conference on Parallel and Distributed Computing, Applications and Technologies;2013-12

5. Implementation of Bin Packing Model for Reed Switch Production Planning;AIP Conference Proceedings;2010