Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
type: Item
instance of: scholarly article
title: Comparison of search strategies of branch and bound algorithm for concave minimization problems under linear constraints
zbMATH Open document ID: 1213.90202
author: Hiroshi Konno
author: Kazuo Izumi
author: Rei Yamamoto
published in: Vietnam Journal of Mathematics
publication date: 2008-07-29T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 91G10
zbMATH DE Number: 5304735
zbMATH Keywords: global optimization
zbMATH Keywords: concave minimization
zbMATH Keywords: branch and bound algorithm
zbMATH Keywords: mixed 0-1 programming
zbMATH Keywords: portfolio optimization
zbMATH Keywords: mean-absolute deviation model
MaRDI profile type: Publication
Recommended article: Q4459573
Recommended article: Convergence-order analysis of branch-and-bound algorithms for constrained problems
Recommended article: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Recommended article: A branch and bound-outer approximation algorithm for concave minimization over a convex set
Recommended article: A finite concave minimization algorithm using branch and bound and neighbor generation
Recommended article: Q4658641
Recommended article: An interval branch and bound algorithm for bound constrained optimization problems
Recommended article: A branch-and-bound algorithm for bound constrained optimization problems without derivatives
Recommended article: Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
description: scientific article; zbMATH DE number 5304735