On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

被引：0

作者：

M. Locatelli

U. Raber

机构：

[1] Universitá di Torino,Dipartimento di Informatica

[2] University of Trier,Department of Mathematics

来源：

Journal of Optimization Theory and Applications | 2000年 / 107卷

关键词：

concave minimization; ω-subdivisions; convergence;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The problem of minimizing a concave function over a polytope is considered. The simplicial branch-and-bound approach is presented and theoretical studies about the convergence of these algorithms are carried on. In particular, the convergence of the algorithm based on so-called ω-subdivisions is proved, which had been an open question for a long time.

引用

页码：69 / 79

页数：10

共 50 条

[1] On convergence of the simplicial branch-and-bound algorithm based on ω-subdivisions
Locatelli, M
Raber, U
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 69 - 79
[2] Finiteness result for the simplicial branch-and-bound algorithm based on ω-subdivisions
Locatelli, M
Raber, U
[J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 81 - 88
[3] Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions
M. Locatelli
U. Raber
[J]. Journal of Optimization Theory and Applications, 2000, 107 : 81 - 88
[4] A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Linderoth, J
[J]. MATHEMATICAL PROGRAMMING, 2005, 103 (02) : 251 - 282
[5] A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Jeff Linderoth
[J]. Mathematical Programming, 2005, 103 : 251 - 282
[6] 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
[7] 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
[8] BRANCH-AND-BOUND ALGORITHM FOR PAGINATION
DUNCAN, J
SCOTT, LW
[J]. OPERATIONS RESEARCH, 1975, 23 (02) : 240 - 259
[9] A simplicial branch-and-bound algorithm for production-transportation problems with inseparable concave production cost
Nagai, H
Kuno, T
[J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2005, 48 (02) : 97 - 110
[10] A BRANCH-AND-BOUND CLUSTERING-ALGORITHM
CHENG, CH
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (05): : 895 - 898

← 1 2 3 4 5 →