Bin packing with directed stackability conflicts
From MaRDI portal
Publication:5501519
DOI10.1515/ausi-2015-0011zbMath1334.68092OpenAlexW2213181852MaRDI QIDQ5501519
Publication date: 4 August 2015
Published in: Acta Universitatis Sapientiae, Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/ausi-2015-0011
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Combinatorial optimization (90C27)
Related Items (2)
New models of graph-bin packing ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
- Lower and upper bounds for the bin packing problem with fragile objects
- Tight bounds for online class-constrained packing
- Approximation algorithms for time constrained scheduling
- Class constrained bin packing revisited
- Polynomial time approximation schemes for class-constrained packing problems
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- An approximation scheme for bin packing with conflicts
- Online results for black and white bin packing
- The class constrained bin packing problem with applications to video-on-demand
- Bin packing with discrete item sizes, part II: Tight bounds on First Fit
- Colorful Bin Packing
- Online Colored Bin Packing
- On online bin packing with LIB constraints
- Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
- On two class-constrained versions of the multiple knapsack problem
This page was built for publication: Bin packing with directed stackability conflicts
