Heuristic algorithms for the three-dimensional bin packing problem-Reference-Cited by-同舟云学术

Heuristic algorithms for the three-dimensional bin packing problem

Published:2002-09 Issue:2 Volume:141 Page:410-420
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Lodi Andrea,Martello Silvano,Vigo Daniele

Publisher

Elsevier BV

Subject

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

Reference9 articles.

1. Bin packing approximation algorithms: Combinatorial analysis;Coffman,1999

2. Approximation algorithms for bin packing: A survey;Coffman,1997

3. Cutting and packing (C&P);Dyckhoff,1997

4. O. Færø, D. Pisinger, M. Zachariasen, Guided local search for the three-dimensional bin packing problem, Technical paper, DIKU, University of Copenhagen, 1999

5. A. Lodi, Algorithms for two-dimensional bin packing and assignment problems, Ph.D. Thesis, University of Bologna, Italy, 2000

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

1. Integrated packing and routing: A model and its solutions;Computers & Operations Research;2024-12

2. A GAN-based genetic algorithm for solving the 3D bin packing problem;Scientific Reports;2024-04-02

3. Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods;Sustainability;2024-02-02

4. Online Three-Dimensional Bin Packing: A DRL Algorithm with the Buffer Zone;Foundations of Computing and Decision Sciences;2024-02-01

5. Solving a 3D bin packing problem with stacking constraints;Computers & Industrial Engineering;2024-02