On the public citation graph
An Algorithm for Global Minimization of Non-Convex Functions
0 signed · 11 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/978-3-030-03868-7openalex-extracted
Bodies of Constant Width: An Introduction to Convex Geometry with Applications
inferredcites →https://doi.org/10.1007/978-3-319-90530-3_26openalex-extracted
On Strong NP-Completeness of Rational Problems
inferredcites →https://doi.org/10.1007/s10107-020-01479-0openalex-extracted
Chebyshev center of the intersection of balls: complexity, relaxation and approximation
inferredcites →https://doi.org/10.1007/s101070050100openalex-extracted
On maximization of quadratic form over intersection of ellipsoids with common center
inferredcites →https://doi.org/10.1007/s10898-006-9127-8openalex-extracted
On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
inferredcites →https://doi.org/10.1007/s10957-022-02018-xopenalex-extracted
On Indefinite Quadratic Optimization over the Intersection of Balls and Linear Constraints
inferredcites →https://doi.org/10.1016/s0022-0000(03)00006-0openalex-extracted
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
inferredcites →https://doi.org/10.1023/a:1008240227198openalex-extracted
A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems
inferredcites →https://doi.org/10.1137/1.9781611974782.69openalex-extracted
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
inferredcites →https://doi.org/10.1287/opre.22.3.602openalex-extracted
Global Maximization of a Convex Function with Linear Inequality Constraints
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.