Asymptotic Results for the Generalized Bin Packing Problem-Reference-Cited by-同舟云学术

Asymptotic Results for the Generalized Bin Packing Problem

Published:2014-02 Issue: Volume:111 Page:663-671
ISSN:1877-0428
Container-title:Procedia - Social and Behavioral Sciences
language:en
Short-container-title:Procedia - Social and Behavioral Sciences

Author:

Baldi Mauro Maria,Crainic Teodor Gabriel,Perboli Guido,Tadei Roberto

Publisher

Elsevier BV

Subject

General Medicine

Reference19 articles.

1. Baldi, M.M., Crainic, T.G., Perboli, G., & Tadei, R. (2013). Worst-case analysis for new online bin packing problems (Technical Report CIRRELT-2013-11). CIRRELT, Montreal, Canada.

2. Baldi, M.M., Crainic, T.G., Perboli, G., & Tadei, R. (2012a). The generalized bin packing problem. Transportation Research Part E, 48, 1205-1220.

3. Baldi, M.M., Crainic, T.G., Perboli, G., & Tadei, R. (2012b). Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items. Annals of Operations Research, DOI 10 1007/s10479-012-1283-2.

4. Crainic, T.G., Perboli, G., Pezzuto, M., & Tadei, R. (2007a). Computing the asymptotic worst-case of bin packing lower bounds. European Journal of Operational Research, 183, 1295-1303.

5. Crainic, T.G., Perboli, G., Pezzuto, M., & Tadei, R. (2007b). New bin packing fast lower bounds. Computers & Operations Research, 34, 3439-3457.

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

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

2. New heuristics for the Stochastic Tactical Railway Maintenance Problem;Omega;2016-09

3. On the generalized bin packing problem;International Transactions in Operational Research;2016-01-18