Approximation algorithms for the capacitated plant allocation problem

Approximation algorithms for the capacitated plant allocation problem

0.00 Avg rating—0 Votes
Article ID: iaor19951466
Country: Netherlands
Volume: 15
Issue: 3
Start Page Number: 115
End Page Number: 126
Publication Date: Apr 1994
Journal: Operations Research Letters
Authors: , ,
Keywords: programming: dynamic, allocation: resources
Abstract:

This paper considers the following optimization problem: Given positive interegs equ1 and nondecreasing functions equ2 for equ3, find equ4 such that equ5 for equ6, equ7 and equ8equ9 is the minimum possible. A fully polynomial approximation scheme for this problem is presented.

Reviews

Required fields are marked *. Your email address will not be published.