Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. (Q1421475): Difference between revisions
From MaRDI portal
Latest revision as of 14:18, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. |
scientific article |
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
