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

DOI10.1016/J.EJOR.2012.10.024MaRDI QIDQ2253499zbMATH OpenOpenAlexFDO

Authors Chung-Shou Liao, Chia-Hong Hsu

Publication date 27 July 2014

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2012.10.024

zbMATH Keywords

bin packingcombinatorial optimizationlower boundsthree-dimensional problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• New lower bounds for the three-dimensional finite bin packing problem
• LATIN 2004: Theoretical Informatics
• The Three-Dimensional Bin Packing Problem
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case

Cited in

(5)

• New lower bounds for the three-dimensional finite bin packing problem
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• Sequential heuristic for the two-dimensional bin-packing problem
• Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
• A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints

Describes a project that uses

Uses Software

• Bison

This page was built for publication: New lower bounds for the three-dimensional orthogonal bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253499)