An improved approximation scheme for variable-sized bin packing
type: Item
instance of: scholarly article
title: An improved approximation scheme for variable-sized bin packing
zbMATH Open document ID: 1356.68265
author: Yong-Cai Geng
author: Sumit K. Garg
published in: Theory of Computing Systems
publication date: 2017-01-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6676007
zbMATH Keywords: bin packing
zbMATH Keywords: variable-sized bin packing
zbMATH Keywords: asymptotic fully polynomial time approximation scheme (AFPTAS)
zbMATH Keywords: knapsack problem
zbMATH Keywords: knapsack problem with inversely proportional profits
zbMATH Keywords: fully polynomial time approximation scheme (FPTAS)
MaRDI profile type: Publication
full work available at URL: s00224-015-9644-2
OpenAlex ID: W2237348435
cites work: Using fast matrix multiplication to find basic solutions
cites work: Q3241581
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
cites work: The trim problem
cites work: Class constrained bin packing revisited
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: Variable Sized Bin Packing
cites work: Q4198056
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Approximate max-min resource sharing for structured concave optimization
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation Algorithms for Min-Max and Max-Min Resource Sharing Problems, and Applications
cites work: An Improved Approximation Scheme for Variable-Sized Bin Packing
cites work: An Improved Knapsack Solver for Column Generation
cites work: An asymptotic fully polynomial time approximation scheme for bin covering.
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Q4821303
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: A fully polynomial approximation algorithm for the 0-1 knapsack problem
cites work: An Efficient Approximation Scheme for Variable-Sized Bin Packing
cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems
cites work: Approximation schemes for packing with item fragmentation
cites work: Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
cites work: Q3575206
cites work: Q4290987
DOI: 10.1007/S00224-015-9644-2
description: scientific article; zbMATH DE number 6676007