An improved approximation scheme for variable-sized bin packing
From MaRDI portal
Publication:504994
DOI10.1007/s00224-015-9644-2zbMath1356.68265OpenAlexW2237348435MaRDI QIDQ504994
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
knapsack problembin packingasymptotic fully polynomial time approximation scheme (AFPTAS)fully polynomial time approximation scheme (FPTAS)knapsack problem with inversely proportional profitsvariable-sized bin packing
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation schemes for packing with item fragmentation
- Class constrained bin packing revisited
- A fully polynomial approximation algorithm for the 0-1 knapsack problem
- Bin packing can be solved within 1+epsilon in linear time
- Using fast matrix multiplication to find basic solutions
- An asymptotic fully polynomial time approximation scheme for bin covering.
- Approximate Max-Min Resource Sharing for Structured Concave Optimization
- Mathematical Methods of Organizing and Planning Production
- The Trim Problem
- An Improved Approximation Scheme for Variable-Sized Bin Packing
- A Linear Programming Approach to the Cutting-Stock Problem
- The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
- Variable Sized Bin Packing
- An Efficient Approximation Scheme for Variable-Sized Bin Packing
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- An Improved Knapsack Solver for Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
- Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
