An Efficient Approximation Scheme for Variable-Sized Bin Packing
From MaRDI portal
Publication:3755240
DOI10.1137/0216012zbMATH Open0618.90081OpenAlexW2032522336MaRDI QIDQ3755240FDOQ3755240
Publication date: 1987
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0216012
Recommendations
Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cited In (43)
- Bin packing with restricted piece sizes
- On the approximability of the two-phase knapsack problem
- Approximation algorithms for extensible bin packing
- Bin packing with general cost structures
- A fast asymptotic approximation scheme for bin packing with rejection
- A bin packing problem with over-sized items
- Approximation algorithms for extensible bin packing
- Approximation algorithms for partitioning small items in unequal bins to minimize the total size
- Security-aware database migration planning
- Vector bin packing with multiple-choice
- Title not available (Why is that?)
- An APTAS for Generalized Cost Variable-Sized Bin Packing
- Variable Sized Bin Packing
- An on-line algorithm for variable-sized bin packing
- Improved Approximation for Vector Bin Packing
- On the bin packing problem with a fixed number of object weights
- Approximating robust bin packing with budgeted uncertainty
- Algorithms for the variable sized bin packing problem
- Packing items into several bins facilitates approximating the separable assignment problem
- Offline black and white bin packing
- Online variable-sized bin packing
- Parallel approximation algorithms for bin packing
- Efficient algorithms for the offline variable sized bin-packing problem
- Title not available (Why is that?)
- An exact algorithm for the type-constrained and variable sized bin packing problem
- Heuristics for the variable sized bin-packing problem
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Variable sized bin packing with color constraints
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
- An AFPTAS for variable sized bin packing with general activation costs
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Variable neighbourhood search for the variable sized bin packing problem
- Approximation algorithms for a hierarchically structured bin packing problem
- Relaxations and exact solution of the variable sized bin packing problem
- A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
- An asymptotic approximation scheme for the concave cost bin packing problem
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- An improved approximation scheme for variable-sized bin packing
- Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic
- Accelerating column generation for variable sized bin-packing problems
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- Cutting optimization with variable-sized stock and inventory status data
- Variable sized online interval coloring with bandwidth
This page was built for publication: An Efficient Approximation Scheme for Variable-Sized Bin Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755240)
