A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem (Q2924147)
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 rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem |
scientific article; zbMATH DE number 6364636
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem |
scientific article; zbMATH DE number 6364636 |
Statements
3 November 2014
0 references
global optimization
0 references
multi-product-sum programming
0 references
branch and bound
0 references
hyper-rectangle reduction
0 references
A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem (English)
0 references
0.8523906469345093
0 references
0.815502941608429
0 references
0.7979112863540649
0 references
0.795033872127533
0 references
