Algorithmic analysis of priority-based bin packing
From MaRDI portal
Publication:831745
DOI10.1007/978-3-030-67899-9_29OpenAlexW3127996756MaRDI QIDQ831745FDOQ831745
Authors: Alvaro Velasquez, Bugra Caskurlu, Piotr Wojciechowski, K. Subramani
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_29
Recommendations
- Analysis of a Compound Bin Packing Algorithm
- Analysis of a Hybrid Algorithm for Packing Unequal Bins
- An analysis of lower bound procedures for the bin packing problem
- Approximation algorithms for a hierarchically structured bin packing problem
- Optimal analysis of best fit bin packing
- The bin packing problem with precedence constraints
- Several methods of analysis for cardinality constrained bin packing
- Several methods of analysis for cardinality constrained bin packing
- Improved analysis of two algorithms for min-weighted sum bin packing
- Probabilistic Analysis of Bin Packing Heuristics
Cites Work
- Title not available (Why is that?)
- Fibonacci heaps and their uses in improved network optimization algorithms
- Title not available (Why is that?)
- Exact exponential algorithms.
- Lower bounds based on the exponential time hypothesis
- Title not available (Why is that?)
- Online algorithms with advice for bin packing and scheduling problems
- The complexity of satisfiability of small depth circuits
- Fast algorithms for bin packing
- Title not available (Why is that?)
- Weight distribution considerations in container loading
- An efficient approach for the multi-pallet loading problem
- A branch-and-cut algorithm for the pallet loading problem
- Simulation of Parallel Random Access Machines by Circuits
- An asymptotic approximation algorithm for 3D-strip packing
- Bin packing with fixed number of bins revisited
- On the generalized bin packing problem
- Completeness in approximation classes beyond APX
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- An overview on polynomial approximation of NP-hard problems
Cited In (3)
This page was built for publication: Algorithmic analysis of priority-based bin packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831745)