A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546)
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 new rectangle branch-and-pruning approach for generalized geometric programming |
scientific article; zbMATH DE number 5128287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new rectangle branch-and-pruning approach for generalized geometric programming |
scientific article; zbMATH DE number 5128287 |
Statements
A new rectangle branch-and-pruning approach for generalized geometric programming (English)
0 references
19 February 2007
0 references
global optimization
0 references
pruning technique
0 references
linear relaxation
0 references
branch-and-bound
0 references
mathematical programming
0 references
0.885729193687439
0 references
0.8840851187705994
0 references
0.8631079792976379
0 references
0.8596776723861694
0 references
0.8549623489379883
0 references
