Computing the asymptotic worst-case of bin packing lower bounds-Reference-Cited by-同舟云学术

Computing the asymptotic worst-case of bin packing lower bounds

Published:2007-12 Issue:3 Volume:183 Page:1295-1303
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Crainic Teodor Gabriel,Perboli Guido,Pezzuto Miriam,Tadei Roberto

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference10 articles.

1. An analysis of lower bound procedures;Bourjolly;Computers and Operations Research,2005

2. Bin packing approximation algorithms: A survey;Coffman,1996

3. T.G. Crainic, G. Perboli, M. Pezzuto, R. Tadei, New bin packing fast lower bounds, Computers and Operations Research, in press.

4. New classes of lower bounds for bin packing problems;Fekete;Mathematical Programming,2001

5. D. Johnson, Near-Optimal Bin Packing Algorithms, Ph.D. thesis, Dept. of Mathematics, M.I.T., Cambridge, MA, 1973.

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

1. Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints;International Journal of Industrial Engineering Computations;2024

2. Bin Packing Methodologies for Capacity Planning in Freight Transportation and Logistics;International Series in Operations Research & Management Science;2024

3. Bin Packing Problem with Conflicts and Item Fragmentation;Computers & Operations Research;2021-02

4. A Generalized Bin Packing Problem for parcel delivery in last-mile logistics;European Journal of Operational Research;2019-05

5. Lower bounds for a bin packing problem with linear usage cost;European Journal of Operational Research;2019-04