Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. |
scientific article; zbMATH DE number 2032820
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. |
scientific article; zbMATH DE number 2032820 |
Statements
Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (English)
0 references
26 January 2004
0 references
The paper deals with scaling algorithms for the minimization \(M\)-convex functions. Applying a scaling technique to the greedy algorithm, the author proposes two scaling algorithms. These scaling algorithms are specialized to the resource allocation problem. Moreover, he discusses an extension of presented algorithms.
0 references
Discrete optimization
0 references
Convex function
0 references
Minimization
0 references
Base polyhedron
0 references
Resource allocation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
