scientific article; zbMATH DE number 2086257

MaRDI QIDQ3044356zbMATH OpenFDO

Authors Hadas Shachnai, Tami Tamir

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860569.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27)

Recommendations

• Tight bounds for online class-constrained packing
• The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
• The class constrained bin packing problem with applications to video-on-demand
• scientific article; zbMATH DE number 1670546
• Online bin packing with cardinality constraints resolved

Cited in

(5)

• Probabilistic analysis of online (class-constrained) bin packing and bin covering
• The class constrained bin packing problem with applications to video-on-demand
• scientific article; zbMATH DE number 1670546 (Why is no real title available?)
• The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
• Tight bounds for online class-constrained packing

This page was built for publication:

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