An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:49, 10 July 2024
scientific article; zbMATH DE number 7703344
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint |
scientific article; zbMATH DE number 7703344 |
Statements
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (English)
0 references
28 June 2023
0 references
matroid intersection
0 references
generalized polymatroid
0 references
nonseparable discrete convex function
0 references
polynomial algorithm
0 references
