Approximate solution of the control problem of supplies with many intervals and concave cost functions

Authors:
A. V. Eremeev;M. Ya. Kovalyov;P. M. Kuznetsov
Affiliations:
Omsk Affiliated Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Omsk, Russia;Belarussian State University, Minsk, Belarus;Omsk State University, Omsk, Russia
Venue:
Automation and Remote Control
Year:
2008

Citing 3
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Approximation of the supply scheduling problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of searching for a cost-minimum plan of supplies of uniform products to one consumer is considered. The set of admissible intervals of the supply volume and concave cost functions of supplies within each interval are preassigned for each supplier. The totally polynomial 驴-approximate algorithm for the given problem and the pseudopolynomial exact algorithm for its partial case are suggested.