Class constrained bin covering (Q970104)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Class constrained bin covering	scientific article

Statements

scholarly article

0 references

Class constrained bin covering (English)

0 references

0 references

0 references

0 references

Theory of Computing Systems

0 references

publication date

10 May 2010

0 references

zbMATH Keywords

bin covering

0 references

online algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00224-008-9129-7

0 references

On a dual version of the one-dimensional bin packing problem

0 references

Algorithms for on-line bin-packing problems with cardinality constraints

0 references

0 references

Approximation schemes for ordered vector packing problems

0 references

0 references

0 references

Online algorithms for a dual version of bin packing

0 references

Bin covering with cardinality constraints

0 references

0 references

An asymptotic fully polynomial time approximation scheme for bin covering.

0 references

0 references

On two class-constrained versions of the multiple knapsack problem

0 references

Polynomial time approximation schemes for class-constrained packing problems

0 references

Tight bounds for online class-constrained packing

0 references

The Class Constrained Bin Packing Problem with Applications to Video-on-Demand

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00224-008-9129-7

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:970104

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