Polyhedral results for a class of cardinality constrained submodular minimization problems (Q1751219)
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: Polyhedral results for a class of cardinality constrained submodular minimization problems |
scientific article; zbMATH DE number 6872129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedral results for a class of cardinality constrained submodular minimization problems |
scientific article; zbMATH DE number 6872129 |
Statements
Polyhedral results for a class of cardinality constrained submodular minimization problems (English)
0 references
24 May 2018
0 references
cardinality constraint
0 references
submodular minimization
0 references
conic integer programming
0 references
cutting planes
0 references
0 references
0 references
0 references
