An algorithmic framework for MINLP with separable non-convexity (Q2897302)
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: An algorithmic framework for MINLP with separable non-convexity |
scientific article; zbMATH DE number 6054057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for MINLP with separable non-convexity |
scientific article; zbMATH DE number 6054057 |
Statements
An Algorithmic Framework for MINLP with Separable Non-Convexity (English)
0 references
10 July 2012
0 references
mixed-integer nonlinear programming
0 references
global optimization
0 references
spatial branch-and-bound
0 references
separable
0 references
non-convex
0 references
0 references
0.904128074645996
0 references
0.8371521234512329
0 references
0.8216825127601624
0 references
0.8169867992401123
0 references
0.8126384615898132
0 references
