The Bin Packing Problem with Precedence Constraints

DOI10.1287/opre.1120.1109zbMath1269.90092OpenAlexW2126559728WikidataQ59222253 ScholiaQ59222253MaRDI QIDQ4909118

José Carlos Díaz Díaz, Mauro Dell'Amico, Manuel Iori

Publication date: 12 March 2013

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

Full work available at URL: https://doi.org/10.1287/opre.1120.1109

zbMATH Keywords

branch-and-boundbin packing problemprecedence constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (13)

Procedures for the bin packing problem with precedence constraints ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Exactly solving packing problems with fragmentation ⋮ A branch and bound algorithm for project scheduling problem with spatial resource constraints ⋮ Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ Bin Packing Problem with Time Lags ⋮ Security-aware database migration planning ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Unnamed Item ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Packing-based branch-and-bound for discrete malleable task scheduling ⋮ A branch-and-price algorithm for the temporal bin packing problem

This page was built for publication: The Bin Packing Problem with Precedence Constraints