On cutting planes for cardinality-constrained linear programs (Q2330656)
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: On cutting planes for cardinality-constrained linear programs |
scientific article; zbMATH DE number 7121184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cutting planes for cardinality-constrained linear programs |
scientific article; zbMATH DE number 7121184 |
Statements
On cutting planes for cardinality-constrained linear programs (English)
0 references
22 October 2019
0 references
complementarity/cardinality constraints
0 references
disjunctive sets
0 references
tableau cuts
0 references
equate-and-relax procedure
0 references
concavity cuts
0 references
Prim's algorithm
0 references
0 references
0 references
0 references
0 references
0.8108547329902649
0 references
0.8090326189994812
0 references
0.7928902506828308
0 references
0.7813754677772522
0 references
0.7778984308242798
0 references
