Bin packing with directed stackability conflicts (Q5501519)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6469736

In more languages

Language	Label	Description	Also known as
English	Bin packing with directed stackability conflicts	scientific article; zbMATH DE number 6469736

Statements

scholarly article

Bin packing with directed stackability conflicts (English)

Acta Universitatis Sapientiae, Informatica

publication date

4 August 2015

zbMATH Keywords

bin packing problem

conflicts

directed conflicts

Hanoi conflicts

unit-size items

dynamic programming

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1515/ausi-2015-0011

Online results for black and white bin packing

Online Colored Bin Packing

Lower and upper bounds for the bin packing problem with fragile objects

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

Colorful Bin Packing

Bin packing with ``largest in bottom'' constraint: tighter bounds and generalizations

On online bin packing with LIB constraints

Class constrained bin packing revisited

An approximation scheme for bin packing with conflicts

Approximation algorithms for time constrained scheduling

Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Tight bounds for online class-constrained packing

Polynomial time approximation schemes for class-constrained packing problems

On two class-constrained versions of the multiple knapsack problem

The class constrained bin packing problem with applications to video-on-demand

Identifiers

zbMATH Open document ID

10.1515/ausi-2015-0011

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:5501519

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5501519&oldid=36194915"