Bin packing with fixed number of bins revisited
From MaRDI portal
Publication:3569896
DOI10.1007/978-3-642-13731-0_25zbMATH Open1285.68065OpenAlexW1590950521MaRDI QIDQ3569896FDOQ3569896
Authors: Stefan Kratsch, Dániel Marx, Ildikó Schlotter, Klaus Jansen 
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_25
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (15)
- Black and White Bin Packing Revisited
- A logarithmic additive integrality gap for bin packing
- On the bin packing problem with a fixed number of object weights
- Complexity of tree-coloring interval graphs equitably
- Extending partial representations of subclasses of chordal graphs
- Polynomiality for bin packing with a constant number of item types
- Hardness and algorithms of equitable tree-coloring problem in chordal graphs
- Polynomiality for Bin Packing with a Constant Number of Item Types
- About the structure of the integer cone and its application to bin packing
- Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption
- Relations between capacity utilization, minimal bin size and bin number
- Bin packing with rejection revisited
- Bin packing under linear constraints
- Bin packing with fixed number of bins 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)
