Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6299321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Undercover: a primal MINLP heuristic exploring a largest sub-MIP |
scientific article; zbMATH DE number 6299321 |
Statements
Undercover: a primal MINLP heuristic exploring a largest sub-MIP (English)
0 references
2 June 2014
0 references
primal heuristic
0 references
mixed-integer nonlinear programming
0 references
large neighborhood search
0 references
mixed-integer quadratically constrained programming
0 references
nonconvex optimization
0 references
0 references
0 references
0.8383782
0 references
0.8330897
0 references
0.83116806
0 references
0.83098507
0 references
0.8295639
0 references
0.8286831
0 references
0.8258608
0 references
0.82516325
0 references
