Approximation algorithms for the capacitated plant allocation problem

Authors:
Martine Labbé;E. F. Schmeichel;S.Louis Hakimi
Affiliations:
Service de Mathématiques de la Gestion, Université Libre de Bruxelles, CP 210/01, Boulevard du Triomphe, B-1050 Brussels, Belgium;Department of Mathematics and Computer Science, San Jose State University, San Jose, CA 95192, USA;Department of Electrical and Computer Engineering, University of California, Davis, CA 95616, USA
Venue:
Operations Research Letters
Year:
1994

Citing 2
Cited 1

Approximate Algorithms for the 0/1 Knapsack Problem

Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)

Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the following optimization problem: Given positive integers n, B, @a"i and nondecreasing functions C"i(.) for i = 1, 2, ..., n, find z = (z"1, z"2...z"n) such that 0== B and @S"i"="1^nC"i(z"i) is the minimum possible. A fully polynomial approximation scheme for this problem is presented.