Approximation schemes for knapsack problems with shelf divisions
type: Item
instance of: scholarly article
title: Approximation schemes for knapsack problems with shelf divisions
zbMATH Open document ID: 1090.90168
published in: Theoretical Computer Science
publication date: 2006-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5015091
zbMATH Keywords: approximation algorithms
zbMATH Keywords: approximation schemes
zbMATH Keywords: knapsack problem
zbMATH Keywords: shelf packing
author: Eduardo C. Xavier
author: Flávio K. Miyazawa
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.10.036
OpenAlex ID: W2139494719
cites work: Q4952619
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: A two-phase roll cutting problem
cites work: The one dimensional Compartmentalised Knapsack problem: a case study
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: The constrained compartmentalised knapsack problem
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Q3439701
DOI: 10.1016/J.TCS.2005.10.036
description: scientific article; zbMATH DE number 5015091