Computing feasible points for binary MINLPs with MPECs (Q1741127)
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: Computing feasible points for binary MINLPs with MPECs |
scientific article; zbMATH DE number 7050496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing feasible points for binary MINLPs with MPECs |
scientific article; zbMATH DE number 7050496 |
Statements
Computing feasible points for binary MINLPs with MPECs (English)
0 references
3 May 2019
0 references
mixed-integer nonlinear optimization
0 references
MINLP
0 references
MPEC
0 references
complementarity constraints
0 references
primal heuristic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7524193525314331
0 references
0.7451959252357483
0 references
0.742457926273346
0 references
0.7396809458732605
0 references
0.7394117116928101
0 references
