New bin packing fast lower bounds-Reference-Cited by-同舟云学术

New bin packing fast lower bounds

Published:2007-11 Issue:11 Volume:34 Page:3439-3457
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

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

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference21 articles.

1. Computers and intractability;Garey,1979

2. An improved lower bound for the bin packing problem;Chen;Discrete Applied Mathematics,1996

3. Crainic TG, Perboli G, Pezzuto M, Tadei R. Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research, forthcoming.

4. Knapsack problems—algorithms and computer implementations;Martello,1990

5. Lower bounds and reduction procedures for the bin packing problem;Martello;Discrete Applied Mathematics,1990

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

1. Capacity planning with uncertainty on contract fulfillment;European Journal of Operational Research;2024-04

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. Generating Bin Packing Heuristic Through Grammatical Evolution Based on Bee Swarm Optimization;Nature-Inspired Design of Hybrid Intelligent Systems;2016-12-10