Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes

被引:0
|
作者
Marco Locatelli
Nguyen V. Thoai
机构
[1] Universitá degli Studi di Firenze,Dipartimento di Sistemi e Informatica
[2] University of Trier,Department of Mathematics
来源
关键词
Concave minimization problems; Branch-and-bound; Local searches; Concavity cuts;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper simplicial branch-and-bound algorithms for concave minimization problems are discussed. Some modifications of the basic algorithm are presented, mainly consisting in rules to start local searches, introduction of cuts and updates of the original objective function. While some of these tools are not new in the literature, it is the first time, to the authors' knowledge, that they are used to guarantee the finiteness of a simplicial branch-and-bound approach.
引用
收藏
页码:107 / 128
页数:21
相关论文
共 50 条