Finite exact branch-and-bound algorithms for concave minimization over polytopes

被引：17

作者：

Locatelli, M

Thoai, NV

机构：

[1] Univ Florence, Dipartimento Sistemi & Informat, I-50139 Florence, Italy

[2] Univ Trier, Dept Math, D-54286 Trier, Germany

来源：

JOURNAL OF GLOBAL OPTIMIZATION | 2000年 / 18卷 / 02期

关键词：

concave minimization problems; branch-and-bound; local searches; concavity cuts;

D O I：

10.1023/A:1008324430471

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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

页数：22

共 50 条

[1] Finite Exact Branch-and-Bound Algorithms for Concave Minimization over Polytopes
Marco Locatelli
Nguyen V. Thoai
[J]. Journal of Global Optimization, 2000, 18 : 107 - 128
[2] A FINITE CONCAVE MINIMIZATION ALGORITHM USING BRANCH-AND-BOUND AND NEIGHBOR GENERATION
BENSON, HP
SAYIN, S
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 1994, 5 (01) : 1 - 14
[3] A COMPOSITE BRANCH-AND-BOUND, CUTTING PLANE ALGORITHM FOR CONCAVE MINIMIZATION OVER A POLYHEDRON
BRETTHAUER, KM
CABOT, AV
[J]. COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (07) : 777 - 785
[4] CONVERGENCE AND RESTART IN BRANCH-AND-BOUND ALGORITHMS FOR GLOBAL OPTIMIZATION - APPLICATION TO CONCAVE MINIMIZATION AND DC OPTIMIZATION PROBLEMS
TUY, H
HORST, R
[J]. MATHEMATICAL PROGRAMMING, 1988, 41 (02) : 161 - 183
[5] On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope
Manousiouthakis, Vasilios I.
Thomas, Neil
Justanieah, Ahmad M.
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2011, 151 (01) : 121 - 134
[6] On a Finite Branch and Bound Algorithm for the Global Minimization of a Concave Power Law Over a Polytope
Vasilios I. Manousiouthakis
Neil Thomas
Ahmad M. Justanieah
[J]. Journal of Optimization Theory and Applications, 2011, 151
[7] A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
Takahito Kuno
Hidetoshi Nagai
[J]. Computational Optimization and Applications, 2008, 39 : 219 - 238
[8] A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
Kuno, Takahito
Nagai, Hidetoshi
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2008, 39 (02) : 219 - 238
[9] On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Li, Chu-Min
Jiang, Hua
Manya, Felip
[J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 84 : 1 - 15
[10] EXPECTED PERFORMANCE OF BRANCH-AND-BOUND ALGORITHMS
LENSTRA, JK
RINNOOYKAN, AHG
[J]. OPERATIONS RESEARCH, 1978, 26 (02) : 347 - 349

← 1 2 3 4 5 →