A linear programming approach for the three-dimensional bin-packing problem

MaRDI QIDQ2861521zbMATH OpenFDO

Authors Mhand Hifi, Imed Kacem, Stéphane Nègre, Lei Wu

Publication date 8 November 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065310001277

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11) Combinatorial optimization (90C27)

Recommendations

• The Three-Dimensional Bin Packing Problem
• New lower bounds for the three-dimensional finite bin packing problem
• Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
• Three-dimensional bin packing problem with variable bin height
• scientific article; zbMATH DE number 21364

Cites work

• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• An exact method for the 2D guillotine strip packing problem
• New classes of fast lower bounds for bin packing problems
• New lower bounds for the three-dimensional finite bin packing problem
• On synchronizable and PSK-synchronizable block codes
• The Three-Dimensional Bin Packing Problem

Cited in

(21)

• Three-dimensional bin packing problem with variable bin height
• Packing small boxes into a big box.
• Heuristic algorithms for the three-dimensional bin packing problem
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• Constraints in container loading -- a state-of-the-art review
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• A comparative review of 3D container loading algorithms
• Dynamic Three-Dimensional Linear Programming
• The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem
• Hybrid greedy heuristics based on linear programming for the three-dimensional single bin-size bin packing problem
• Airfreight forwarder's shipment planning: shipment consolidation and containerization
• A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority
• A large neighbourhood search algorithm for solving container loading problems
• A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
• A block-building constraint programming model for the container loading problem
• A three-dimensional multiple containers loading approach considering weak heterogeneous containers for multiple customers
• Integrated packing and routing: a model and its solutions

This page was built for publication: A linear programming approach for the three-dimensional bin-packing problem

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