A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656)
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 computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs |
scientific article; zbMATH DE number 1079002
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs |
scientific article; zbMATH DE number 1079002 |
Statements
A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (English)
0 references
26 October 1997
0 references
convex 0-1 mixed integer nonlinear programs
0 references
test problems
0 references
branch-and-bound
0 references
0 references
0.8126423954963684
0 references
0.7721115946769714
0 references
0.7664595246315002
0 references
0.7629731893539429
0 references
