Algorithmic analysis of priority-based bin packing
From MaRDI portal
Publication:831745
DOI10.1007/978-3-030-67899-9_29OpenAlexW3127996756MaRDI QIDQ831745
Bugra Caskurlu, Alvaro Velasquez, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_29
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online algorithms with advice for bin packing and scheduling problems
- Exact exponential algorithms.
- Weight distribution considerations in container loading
- An efficient approach for the multi-pallet loading problem
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- A branch-and-cut algorithm for the pallet loading problem
- Fast algorithms for bin packing
- Bin packing with fixed number of bins revisited
- Completeness in approximation classes beyond APX
- Simulation of Parallel Random Access Machines by Circuits
- An asymptotic approximation algorithm for 3D-strip packing
- An overview on polynomial approximation of NP-hard problems
- The Complexity of Satisfiability of Small Depth Circuits
- Fibonacci heaps and their uses in improved network optimization algorithms
- On the generalized bin packing problem
This page was built for publication: Algorithmic analysis of priority-based bin packing
