Branch-and-cut for complementarity-constrained optimization (Q482112)
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: Branch-and-cut for complementarity-constrained optimization |
scientific article; zbMATH DE number 6381889
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut for complementarity-constrained optimization |
scientific article; zbMATH DE number 6381889 |
Statements
Branch-and-cut for complementarity-constrained optimization (English)
0 references
19 December 2014
0 references
complementarity
0 references
multiple-choice
0 references
special ordered set
0 references
mixed-integer programming
0 references
knapsack set
0 references
polyhedral method
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
0.9136274
0 references
0.91086406
0 references
0.9014324
0 references
0.8933908
0 references
0.88630015
0 references
0.8861197
0 references
