On the public citation graph
On the convergence of two branch-and-bound algorithms for nonconvex programming problems
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01580678openalex-snapshot
An algorithm for nonconvex programming problems
inferredcites →https://doi.org/10.1287/mnsc.15.9.550openalex-snapshot
An Algorithm for Separable Nonconvex Programming Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199008)37:4<433::aid-nav3220370403>3.0.co;2-2openalex-snapshot
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
inferred← citeshttps://doi.org/10.1002/1520-6750(199206)39:4<447::aid-nav3220390403>3.0.co;2-oopenalex-snapshot
A squared-euclidean distance location-allocation problem
inferred← citeshttps://doi.org/10.1002/nav.20011openalex-snapshot
Concave envelopes of monomial functions over rectangles
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_3openalex-snapshot
Concave Minimization: Theory, Applications and Algorithms
inferred← citeshttps://doi.org/10.1007/bf00120667openalex-snapshot
An all-linear programming relaxation algorithm for optimizing over the efficient set
inferred← citeshttps://doi.org/10.1007/bf00935342openalex-snapshot
Algorithms for parametric nonconvex programming
inferred← citeshttps://doi.org/10.1007/bf00939768openalex-snapshot
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
inferred← citeshttps://doi.org/10.1007/bf00939824openalex-snapshot
Coefficient estimation in a first-order nonlinear hyperbolic Cauchy problem
inferred← citeshttps://doi.org/10.1007/bf00939825openalex-snapshot
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
inferred← citeshttps://doi.org/10.1007/bf00940077openalex-snapshot
A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
inferred← citeshttps://doi.org/10.1007/bf00940633openalex-snapshot
Method for minimizing a convex-concave function over a convex set
inferred← citeshttps://doi.org/10.1007/bf01096777openalex-snapshot
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf01097060openalex-snapshot
On the selection of subdivision directions in interval branch-and-bound methods for global optimization
inferred← citeshttps://doi.org/10.1007/bf01100238openalex-snapshot
Calculation of bounds on variables satisfying nonlinear inequality constraints
inferred← citeshttps://doi.org/10.1007/bf01580772openalex-snapshot
Inclusion functions and global optimization II
inferred← citeshttps://doi.org/10.1007/bf01580907openalex-snapshot
Convergence qualification of adaptive partition algorithms in global optimization
inferred← citeshttps://doi.org/10.1007/bf01594938openalex-snapshot
Concave minimization via conical partitions and polyhedral outer approximation
inferred← citeshttps://doi.org/10.1007/bf02192125openalex-snapshot
Deletion-by-infeasibility rule for DC-constrained global optimization
inferred← citeshttps://doi.org/10.1007/bf02283684openalex-snapshot
On solving general reverse convex programming problems by a sequence of linear programs and line searches
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90059-eopenalex-snapshot
Separable concave minimization via partial outer approximation and branch and bound
inferred← citeshttps://doi.org/10.1016/0898-1221(91)90163-xopenalex-snapshot
Global optimization algorithms for linearly constrained indefinite quadratic problems
inferred← citeshttps://doi.org/10.1051/ro/1994280100011openalex-snapshot
Genetic algorithm based approach to bi-level linear programming
inferred← citeshttps://doi.org/10.1137/1028106openalex-snapshot
Methods for Global Concave Minimization: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1137/s0036142995281528openalex-snapshot
Subdivision Direction Selection in Interval Methods for Global Optimization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.