The bin packing problem with precedence constraints

DOI10.1287/OPRE.1120.1109MaRDI QIDQ4909118zbMATH OpenOpenAlexWikidataFDO

Authors Mauro Dell'Amico, J. C. Diaz, 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

bin packing problembranch-and-boundprecedence constraints

Mathematics Subject Classification ID

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

Recommendations

• Procedures for the bin packing problem with precedence constraints
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• A pegging approach to the precedence-constrained knapsack problem
• An exact algorithm for the type-constrained and variable sized bin packing problem
• Algorithms for the bin packing problem with conflicts

Cited in

(20)

• A branch and bound algorithm for project scheduling problem with spatial resource constraints
• Packing-based branch-and-bound for discrete malleable task scheduling
• A branch-and-price algorithm for the temporal bin packing problem
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Procedures for the bin packing problem with precedence constraints
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Connected bin packing problem on traceable graphs
• Exactly solving packing problems with fragmentation
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
• Bin Packing Problem with Time Lags
• Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
• R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines
• Security-aware database migration planning
• Priority-based bin packing with subset constraints
• Flight test scheduling: a generic model, lower bounds, and iterated local search
• Comparing loading strategies for auto-trains: balancing efficiency with information requirements
• Weighted quantum genetic algorithm for one-dimensional bin packing problem
• Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
• Generalized last open-end bin packing problem
• Algorithmic analysis of priority-based bin packing

This page was built for publication: The bin packing problem with precedence constraints

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