Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints (Q934175): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 01:41, 5 March 2024
scientific article
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 |
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