An analysis of lower bound procedures for the bin packing problem-Reference-Cited by-同舟云学术

An analysis of lower bound procedures for the bin packing problem

Published:2005-03 Issue:3 Volume:32 Page:395-405
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Bourjolly Jean-Marie,Rebetez Vianney

Publisher

Elsevier BV

Subject

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

Reference14 articles.

1. Computers and intractability. A guide to the theory of NP-completeness;Garey,1979

2. Chen C, Liu M. An application of bin packing to building block placement. International Symposium on Circuits and Systems, Philadelphia, vol. 2. 1987. p. 576–9.

3. Aveyard RL, Butler DE. Transmission terminal utilization as a bin packing problem. International Conference on Communications, Toronto, vol. 1. 1978. p. 5.3.1–5.

4. An application of bin packing to mutiprocessor scheduling;Coffman;SIAM Journal on Computing,1978

5. Prabhu V, Tam RMK. Bin packing applied to port allocation in a multiprocessor packet switch. International Conference on Communications, Toronto, vol. 3. 1978. p. 36.4.1–6.

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

1. An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict;Mathematics;2023-07-22

2. SALSA: Combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing;European Journal of Operational Research;2021-12

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

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

5. Integrated production and distribution scheduling with a perishable product;European Journal of Operational Research;2017-06