A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (Q3682254): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 08:53, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory |
scientific article |
Statements
A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory (English)
0 references
1985
0 references
greedy algorithm
0 references
polymatroid theory
0 references