An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint (Q6161898): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2023.01.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4315476327 / rank | |||
Normal rank | |||
Revision as of 11:08, 30 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
