Separable convex resource allocation problem with \(L_1\)-distance constraint (Q5208430)
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: Separable convex resource allocation problem with Lā-distance constraint |
scientific article; zbMATH DE number 7152127
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Separable convex resource allocation problem with \(L_1\)-distance constraint |
scientific article; zbMATH DE number 7152127 |
Statements
15 January 2020
0 references
discrete optimization
0 references
resource allocation problem
0 references
separable convex function
0 references
polymatroid constraint
0 references
0.8283093571662903
0 references
0.7918984889984131
0 references
0.7768251299858093
0 references
