A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce

DOI10.1287/OPRE.2022.2369MaRDI QIDQ6202673FDOQ6202673

Authors: Pirmin Fontaine, Stefan Minner 

Publication date: 26 February 2024

Published in: Operations Research (Search for Journal in Brave)

Recommendations

• A linear programming approach for the three-dimensional bin-packing problem
• The Three-Dimensional Bin Packing Problem
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
• A generalized bin packing problem for parcel delivery in last-mile logistics
• Three-dimensional bin packing problem with variable bin height

zbMATH Keywords

transportationmixed integer programminge-commercethree-dimensional bin packingdecomposition reformulationthree-dimensional bin selection

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cited In (1)

• Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model

This page was built for publication: A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce

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