Upper bounds and algorithms for the maximum cardinality bin packing problem.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1418266 (Why is no real title available?)
- scientific article; zbMATH DE number 1445306 (Why is no real title available?)
- An exact algorithm for the dual bin packing problem
- Bin packing: Maximizing the number of pieces packed
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
- Heuristic algorithms for the multiple knapsack problem
- Lower bounds and reduction procedures for the bin packing problem
- Probabilistic analysis of a heuristic for the dual bin packing problem
- Probabilistic bounds for dual bin-packing
- Solving Multiple Knapsack Problems by Cutting Planes
Cited in
(10)- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver
- Models and complexity of multibin packing problems
- Improved filtering for the bin-packing with cardinality constraint
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- Mathematical models and decomposition methods for the multiple knapsack problem
- A novel discrete differential evolution algorithm combining transfer function with modulo operation for solving the multiple knapsack problem
- An improved typology of cutting and packing problems
- A branch-and-bound algorithm for hard multiple knapsack problems
- Packing items to feed assembly lines
- Maximizing the number of mixed packages subject to variety constraints
This page was built for publication: Upper bounds and algorithms for the maximum cardinality bin packing problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399594)
