The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Valuated matroids / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Submodular functions and optimization. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A framework of discrete DC programming by discrete convex analysis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2999658 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: M-Convex Function on Generalized Polymatroid / rank | |||
Normal rank | |||
Latest revision as of 16:49, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions |
scientific article |
Statements
The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (English)
0 references
28 September 2018
0 references
\(M^{\natural}\)-convex set functions
0 references
DC programming
0 references
matroid
0 references
NP-hardness
0 references
