A fully polynomial approximation scheme for a knapsack problem with a minimum filling constraint

Authors:
Zhou Xu;Xiaofan Lai
Affiliations:
Dept. of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University;Dept. of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 5
Cited 0

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem

INFORMS Journal on Computing
Optimal buying from online retailers offering total value discounts

Proceedings of the 10th international conference on Electronic commerce
Fully Polynomial Approximation Schemes for a Symmetric Quadratic Knapsack Problem and its Scheduling Applications

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a variant of the knapsack problem, where a minimum filling constraint is imposed such that the total weight of selected items cannot be less than a given threshold. We consider the case when the ratio of the threshold to the capacity equals a given constant α with 0 ≤ α