New lower bounds for the three-dimensional finite bin packing problem

DOI10.1016/j.dam.2003.08.004zbMath1069.90085MaRDI QIDQ1827849

Marco Antonio Boschetti

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

zbMATH Keywords

Combinatorial optimization; Bin packing; Lower bound

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

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, New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation, TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item