Cardinality constrained bin-packing problems
From MaRDI portal
Recommendations
Cited in
(36)- Vehicle scheduling under the warehouse-on-wheels policy
- Approximation schemes for packing splittable items with cardinality constraints
- Improved results for a memory allocation problem
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- Selfish bin packing with cardinality constraints
- Scheduling with cardinality dependent unavailability periods
- EPTAS for the dual of splittable bin packing with cardinality constraint
- Tight bounds for online class-constrained packing
- Improved filtering for the bin-packing with cardinality constraint
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- The tight asymptotic approximation ratio of first fit for bin packing with cardinality constraints
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Approximation Schemes for Packing Splittable Items with Cardinality Constraints
- scientific article; zbMATH DE number 2081032 (Why is no real title available?)
- Polynomial time approximation schemes for class-constrained packing problems
- Upper bounds and algorithms for the maximum cardinality bin packing problem.
- scientific article; zbMATH DE number 5936584 (Why is no real title available?)
- Bin covering with cardinality constraints
- Priority-based bin packing with subset constraints
- Online bin packing with cardinality constraints resolved
- Parameterized complexity of configuration integer programs
- Homogeneous grouping of non-prime steel products for online auctions: a case study
- Online bin packing with cardinality constraints resolved
- On Packing Splittable Items with Cardinality Constraints
- Principles and Practice of Constraint Programming – CP 2004
- Constructive heuristics for the canister filling problem
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- Improved lower bounds for the online bin packing problem with cardinality constraints
- Class constrained bin packing revisited
- Maximizing the number of mixed packages subject to variety constraints
- Consistency check for the bin packing constraint revisited
- Bounds for online bin packing with cardinality constraints
- Chance-Constrained Binary Packing Problems
- The influence of the fitness evaluation method on the performance of multiobjective search algorithms
- Bin packing under linear constraints
This page was built for publication: Cardinality constrained bin-packing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960326)
