No label defined (Q4247449)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1302182
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1302182 |
Statements
10 October 2000
0 references
resource allocation problems
0 references
algorithms
0 references
0.92330694
0 references
0.9158244
0 references
0.9149718
0 references
This is an exellent overview of the recent state on the theory and applications of the s.c. resource allocation problem (RAP) which seeks to find an optimal allocation of fixed amount of resources to activities so as to minimize the cost of allocation. The organization of the paper is as follows. Section 2 defines several types of RAP, say a/b/c, where c is for integer or continuous variables, resp., and a is for the objective function class: separable, separable and convex, minimax, lexicographically minimax, fair; and b is for the constraints type: lower and upper bounds, GUB, nested constraints, tree constraints, network constraints, submodular constraints, general linear constraints. Section 3 gives fundamental algorithms for the separable convex and minimax problems with different types of constraints. Section 4-6 review results developed in the 90's. Section 7 outlines some new applications, and section 8 is for further related topics. For the entire collection see [Zbl 0914.90001].
0 references