A Numerically Exact Algorithm for the Bin-Packing Problem

DOI10.1287/IJOC.2022.0257MaRDI QIDQ6202337zbMATH OpenFDO

Authors Roberto Baldacci, S. Coniglio, Jean-François Cordeau, Fabio Furini

Publication date 26 March 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0257

zbMATH Keywords

bin packingbranch-price-and-cut algorithmdynamic programmingnumerical precision

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Exact solution of bin-packing problems using column generation and branch-and-bound
• An exact algorithm for the dual bin packing problem
• Solving bin packing problems using VRPSolver models

Cited in

(4)

• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
• Classification and evaluation of the algorithms for vector bin packing
• Fast neighborhood search heuristics for the colored bin packing problem

This page was built for publication: A Numerically Exact Algorithm for the Bin-Packing Problem

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