An improved approximation scheme for variable-sized bin packing
From MaRDI portal
(Redirected from Publication:504994)
Recommendations
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 5761488 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- An Improved Knapsack Solver for Column Generation
- An asymptotic fully polynomial time approximation scheme for bin covering.
- An improved approximation scheme for variable-sized bin packing
- Approximate max-min resource sharing for structured concave optimization
- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
- Approximation schemes for packing with item fragmentation
- Bin packing can be solved within 1+epsilon in linear time
- Class constrained bin packing revisited
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- The trim problem
- Using fast matrix multiplication to find basic solutions
- Variable Sized Bin Packing
Cited in
(13)- A two-phase algorithm for bin stretching with stretching factor 1.5
- Improved Approximation for Vector Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Improved bounds for harmonic-based bin packing algorithms
- Efficient algorithms for the offline variable sized bin-packing problem
- Notes on inverse bin-packing problems
- An AFPTAS for variable sized bin packing with general activation costs
- An improved approximation scheme for variable-sized bin packing
- A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
- A note on a variant of the online open end bin packing problem
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- Approximation algorithms for generalized and variable-sized bin covering
This page was built for publication: An improved 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 Q504994)
