A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
Data up to Jan 2025
Total Citations Per Year
Abstract
References (16)
Convex Analysis
1970 • 9,645 citations
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
1976 • 2,064 citations
An Algorithm for Separable Nonconvex Programming Problems
1969 • 398 citations
An algorithm for nonconvex programming problems
1976 • 157 citations
Convergent Algorithms for Minimizing a Concave Function
1980 • 125 citations
Lagrange Multipliers and Nonconvex Programs
1969 • 103 citations
An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints
1971 • 92 citations
A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
1985 • 79 citations
On the global minimization of concave functions
1984 • 67 citations
On the convergence of two branch-and-bound algorithms for nonconvex programming problems
1982 • 29 citations
A note on the convergence of an algorithm for nonconvex programming problems
1980 • 25 citations
Global stability of optimization problems
1977 • 20 citations
Nichtlineare Optimierung
1991 • 15 citations
Supports and convex envelopes
1985 • 14 citations
A new branch and bound approach for concave minimization problems
1976 • 12 citations
Zur Charakterisierung affin‐linearer Hüllfunktionale
1976 • 3 citations