scientific article; zbMATH DE number 2081032

MaRDI QIDQ4474134zbMATH OpenFDO

Authors Luitpold Babel, Bo Chen, Hans Kellerer, V. M. Kotov

Publication date 4 August 2004

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

zbMATH Keywords

bin packingcardinality constrainton-line

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for on-line bin-packing problems with cardinality constraints
• Cardinality constrained bin-packing problems
• Online Bin Packing with Cardinality Constraints
• Algorithms – ESA 2005
• Online bin packing with cardinality constraints resolved

Cited in

(16)

• Multidimensional on-line bin packing: Algorithms and worst-case analysis
• Improved filtering for the bin-packing with cardinality constraint
• Performance analysis and improvement for some linear on-line bin-packing algorithms
• Maximizing the number of mixed packages subject to variety constraints
• Algorithms for on-line bin-packing problems with cardinality constraints
• Cardinality constrained bin-packing problems
• Online bin packing with cardinality constraints resolved
• The class constrained bin packing problem with applications to video-on-demand
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Bounds for online bin packing with cardinality constraints
• On the online bin packing problem
• The Class Constrained Bin Packing Problem with Applications to Video-on-Demand
• On-line bin packing ? A restricted survey
• Algorithms – ESA 2005
• Tight bounds for online class-constrained packing
• Several methods of analysis for cardinality constrained bin 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 Q4474134)