New lower bounds for the three-dimensional finite bin packing problem
From MaRDI portal
Publication:1827849
DOI10.1016/j.dam.2003.08.004zbMath1069.90085OpenAlexW1986228108MaRDI QIDQ1827849
Publication date: 6 August 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.08.004
Related Items (15)
TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem ⋮ A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem ⋮ An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation ⋮ A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing ⋮ A survey of dual-feasible and superadditive functions ⋮ Routing problems with loading constraints ⋮ The multiple container loading problem with loading docks ⋮ A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ Efficient algorithms for orthogonal packing problems ⋮ Unnamed Item ⋮ A comparative review of 3D container loading algorithms ⋮ Hybrid greedy heuristics based on linear programming for the three‐dimensional single bin‐size bin packing problem ⋮ Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing problems
- Two-dimensional packing problems: a survey
- Heuristic algorithms for the three-dimensional bin packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
This page was built for publication: New lower bounds for the three-dimensional finite bin packing problem
