Branch-and-cut for complementarity-constrained optimization (Q482112): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s12532-014-0070-2 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S12532-014-0070-2 / rank | |||
Normal rank | |||
Revision as of 02:30, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut for complementarity-constrained optimization |
scientific article |
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
