Algorithms for the variable sized bin packing problem-Reference-Cited by-同舟云学术

Algorithms for the variable sized bin packing problem

Published:2003-06 Issue:2 Volume:147 Page:365-372
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Kang Jangha,Park Sungsoo

Publisher

Elsevier BV

Subject

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

Reference8 articles.

1. Approximation algorithms for bin packing—an updated survey;Coffman,1984

2. Bin packing with divisible item sizes;Coffman;J. Complexity,1987

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

4. A linear programming approach to the cutting stock problem;Gilmore;Oper. Res.,1961

5. ITU-T recommendation. E.735, Framework for traffic control and dimensioning in B-ISDN, 1997

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

1. Capacity planning in logistics corridors: Deep reinforcement learning for the dynamic stochastic temporal bin packing problem;Transportation Research Part E: Logistics and Transportation Review;2024-11

2. Metaheuristics for Solving Global and Engineering Optimization Problems: Review, Applications, Open Issues and Challenges;Archives of Computational Methods in Engineering;2024-08-21

3. Multiple bin-size bin packing problem considering incompatible product categories;Expert Systems with Applications;2024-08

4. A Differential Pheromone Grouping Ant Colony Optimization Algorithm for the 1-D Bin Packing Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

5. Integrating Operations Research into Very Large-Scale Integrated Circuits Placement Design: A Review;Asia-Pacific Journal of Operational Research;2024-07-06