An improved approximation scheme for variable-sized bin packing
DOI10.1007/S00224-015-9644-2zbMATH Open1356.68265OpenAlexW2237348435MaRDI QIDQ504994FDOQ504994
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 18 January 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9644-2
Recommendations
knapsack problembin packingasymptotic fully polynomial time approximation scheme (AFPTAS)fully polynomial time approximation scheme (FPTAS)knapsack problem with inversely proportional profitsvariable-sized bin packing
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Bin packing can be solved within 1+epsilon in linear time
- Approximate max-min resource sharing for structured concave optimization
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Title not available (Why is that?)
- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- The trim problem
- Variable Sized Bin Packing
- Approximation schemes for packing with item fragmentation
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Class constrained bin packing revisited
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Using fast matrix multiplication to find basic solutions
- An improved approximation scheme for variable-sized bin packing
- Title not available (Why is that?)
- An Improved Knapsack Solver for Column Generation
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)
