On the public citation graph

Mathematical programming study 4

https://doi.org/10.1007/bf01580687
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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1097-0207(19961130)39:22<3889::aid-nme29>3.0.co;2-6openalex-snapshot
A NOVEL FINITE ELEMENT APPROACH TO FRICTIONAL CONTACT PROBLEMS
inferred← citeshttps://doi.org/10.1002/0471667196.ess1556openalex-snapshot
Mathematical Programming
inferred← citeshttps://doi.org/10.1002/0471667196.ess1556.pub2openalex-snapshot
Mathematical Programming
inferred← citeshttps://doi.org/10.1002/1520-6750(198706)34:3<431::aid-nav3220340309>3.0.co;2-popenalex-snapshot
A new surrogate dual multiplier search procedure
inferred← citeshttps://doi.org/10.1002/9781118445112.stat02287openalex-snapshot
Mathematical Programming
inferred← citeshttps://doi.org/10.1002/nav.3800300107openalex-snapshot
The traveling salesman problem: An update of research
inferred← citeshttps://doi.org/10.1007/bf00939042openalex-snapshot
Penalty-proximal methods in convex programming
inferred← citeshttps://doi.org/10.1007/s10898-016-0440-6openalex-snapshot
Differentiable McCormick relaxations
inferred← citeshttps://doi.org/10.1017/s0962492900002518openalex-snapshot
Sequential Quadratic Programming
inferred← citeshttps://doi.org/10.1080/17442508308833246openalex-snapshot
stochastic quasigradient methods and their application to system optimization †
inferred← citeshttps://doi.org/10.1103/physreve.73.040101openalex-snapshot
Scaling of ballistic deposition from a Langevin equation
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.