Bin packing with fixed number of bins revisited
From MaRDI portal
Publication:3569896
Recommendations
Cited in
(17)- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Polynomiality for bin packing with a constant number of item types
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
- Bin packing with rejection revisited
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
- Complexity of tree-coloring interval graphs equitably
- Bin packing under linear constraints
- Bin packing with fixed number of bins revisited
- On the bin packing problem with a fixed number of object weights
- Extending partial representations of subclasses of chordal graphs
- A faster exponential time algorithm for bin packing with a constant number of bins via additive combinatorics
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
- Polynomiality for Bin Packing with a Constant Number of Item Types
- About the structure of the integer cone and its application to bin packing
- Relations between capacity utilization, minimal bin size and bin number
- A logarithmic additive integrality gap for bin packing
- Black and White Bin Packing Revisited
This page was built for publication: Bin packing with fixed number of bins revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569896)