Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GloMIQO / rank | |||
Normal rank | |||
Revision as of 08:55, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undercover: a primal MINLP heuristic exploring a largest sub-MIP |
scientific article |
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
