The complexity of minimizing the difference of two \(M^{\natural}\)-convex set functions (Q1785434): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.orl.2015.08.011 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1236105380 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
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