Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (Q940828): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10100-007-0051-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091879840 / rank | |||
Normal rank | |||
Revision as of 21:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lago: a (heuristic) branch and cut algorithm for nonconvex minlps |
scientific article |
Statements
Lago: a (heuristic) branch and cut algorithm for nonconvex minlps (English)
0 references
3 September 2008
0 references
global optimization
0 references
branch and bound
0 references
branch and cut
0 references
outer approximation
0 references
mixed-integer nonlinear programming
0 references
