Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints (Q934175)
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: Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints |
scientific article; zbMATH DE number 5304735
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints |
scientific article; zbMATH DE number 5304735 |
Statements
Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints (English)
0 references
29 July 2008
0 references
global optimization
0 references
concave minimization
0 references
branch and bound algorithm
0 references
mixed 0-1 programming
0 references
portfolio optimization
0 references
mean-absolute deviation model
0 references
0.8833907
0 references
0.8833113
0 references
0.87867326
0 references
0.87617326
0 references
0 references
0.8666844
0 references
