Bin packing with directed stackability conflicts

DOI10.1515/AUSI-2015-0011MaRDI QIDQ5501519zbMATH OpenOpenAlexFDO

Authors Attila Bódis

Publication date 4 August 2015

Published in Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.1515/ausi-2015-0011

zbMATH Keywords

bin packing problemconflictsdirected conflictsdynamic programmingHanoi conflictsunit-size items

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)

Recommendations

• Algorithms for the bin packing problem with conflicts
• On Bin Packing with Conflicts
• Heuristics for solving the bin-packing problem with conflicts
• On Bin Packing with Conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts

Cites work

• An approximation scheme for bin packing with conflicts
• Approximation algorithms for time constrained scheduling
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
• Bin packing with discrete item sizes, part II: Tight bounds on First Fit
• Class constrained bin packing revisited
• Colorful bin packing
• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 53892 (Why is no real title available?)
• scientific article; zbMATH DE number 2105043 (Why is no real title available?)
• Lower and upper bounds for the bin packing problem with fragile objects
• On online bin packing with LIB constraints
• On two class-constrained versions of the multiple knapsack problem
• Online colored bin packing
• Online results for black and white bin packing
• Polynomial time approximation schemes for class-constrained packing problems
• The class constrained bin packing problem with applications to video-on-demand
• Tight bounds for online class-constrained packing
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Cited in

(2)

• New models of graph-bin packing
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

This page was built for publication: Bin packing with directed stackability conflicts

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