A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795)
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: A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures |
scientific article; zbMATH DE number 5304066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures |
scientific article; zbMATH DE number 5304066 |
Statements
A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (English)
0 references
25 July 2008
0 references
Global optimization
0 references
Lagrangean decomposition
0 references
Cuts
0 references
Two-stage stochastic programming
0 references
0 references
0 references
0 references
0 references
0.8094147443771362
0 references
0.797420084476471
0 references
0.7908643484115601
0 references
0.785605788230896
0 references
0.7849774956703186
0 references
