On the convergence of two branch-and-bound algorithms for nonconvex programming problems-Reference-Cited by-同舟云学术

On the convergence of two branch-and-bound algorithms for nonconvex programming problems

Published:1982-01 Issue:1 Volume:36 Page:129-134
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Benson H. P.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00934342.pdf

Reference4 articles.

1. Falk, J. E., andSoland, R. M.,An Algorithm for Separable Nonconvex Programming Problems, Management Science, Vol. 15, pp. 550?569, 1969.

2. Horst, R.,An Algorithm for Nonconvex Programming Problems, Mathematical Programming, Vol. 10, pp. 312?321, 1976.

3. Horst, R., Private Communication, 1980.

4. Benson, H. P.,On the Convergence of Two Branch-and-Bound Algorithms for Nonconvex Programming Problems, University of Florida, Center for Econometrics and Decision Sciences, Discussion Paper No. 3, 1979.

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Concave envelopes of monomial functions over rectangles;Naval Research Logistics;2004-06

2. Subdivision Direction Selection in Interval Methods for Global Optimization;SIAM Journal on Numerical Analysis;1997-06

3. Deterministic algorithms for constrained concave minimization: A unified critical survey;NAV RES LOG;1996

4. On the selection of subdivision directions in interval branch-and-bound methods for global optimization;Journal of Global Optimization;1995-09

5. Deletion-by-infeasibility rule for DC-constrained global optimization;Journal of Optimization Theory and Applications;1995-02