A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

Publisher Website

1 November 1986

journal article
Published by Springer Nature in Journal of Optimization Theory and Applications

Vol. 51 (2) , 271-291
https://doi.org/10.1007/bf00939825

Abstract

No abstract available

Keywords

This publication has 15 references indexed in Scilit:

Supports and convex envelopes
Mathematical Programming, 1985
On the global minimization of concave functions
OR Spectrum, 1984
A note on the convergence of an algorithm for nonconvex programming problems
Mathematical Programming, 1980
Convergent Algorithms for Minimizing a Concave Function
Mathematics of Operations Research, 1980
Global stability of optimization problems
Mathematische Operationsforschung und Statistik. Series Optimization, 1977
An algorithm for nonconvex programming problems
Mathematical Programming, 1976
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
Mathematical Programming, 1976
An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
Management Science, 1971
Convex Analysis
Published by Walter de Gruyter GmbH ,1970
An Algorithm for Separable Nonconvex Programming Problems
Management Science, 1969