On the public citation graph

Partly convex programming and zermelo's navigation problems

https://doi.org/10.1007/bf01279450
0 signed · 31 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/zamm.19310110205openalex-snapshot
Über das Navigationsproblem bei ruhender oder veränderlicher Windverteilung
inferredcites →https://doi.org/10.1002/zamm.19940740802openalex-snapshot
On a Method of Weierstraß for the Simultaneous Calculation of the Roots of a Polynomial
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5_6openalex-snapshot
On Procedures for Analysing Parametric Optimization Problems
inferredcites →https://doi.org/10.1007/bf00047497openalex-snapshot
Characterizing optimality in mathematical programming models
inferredcites →https://doi.org/10.1007/bf00932662openalex-snapshot
A note on functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf00933262openalex-snapshot
A simplified test for optimality
inferredcites →https://doi.org/10.1007/bf00934960openalex-snapshot
On the method of multipliers for mathematical programming problems
inferredcites →https://doi.org/10.1007/bf01096414openalex-snapshot
New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
inferredcites →https://doi.org/10.1007/bf01096418openalex-snapshot
A remark on the GOP algorithm for global optimization
inferredcites →https://doi.org/10.1007/bf01262931openalex-snapshot
On functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf01535411openalex-snapshot
An extension of geometric programming with applications in engineering optimization
inferredcites →https://doi.org/10.1007/bf01582159openalex-snapshot
A simple constraint qualification in convex programming
inferredcites →https://doi.org/10.1017/s0334270000006275openalex-snapshot
Constraint qualifications in input optimisation
inferredcites →https://doi.org/10.1063/1.463486openalex-snapshot
A global optimization approach for Lennard-Jones microclusters
inferredcites →https://doi.org/10.1080/02331939108843676openalex-snapshot
The marginal value formula in input optimization
inferredcites →https://doi.org/10.1080/02331939308843869openalex-snapshot
The marginal value formula on regions of stability
inferredcites →https://doi.org/10.1115/1.3167074openalex-snapshot
Optimality in Parametric Systems
inferredcites →https://doi.org/10.1287/ijoc.2.3.225openalex-snapshot
A Decomposition Strategy for Global Optimum Search in the Pooling Problem
inferredcites →https://doi.org/10.1287/moor.11.4.679openalex-snapshot
On Iterated Minimization in Nonconvex Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_16openalex-snapshot
Optimality and Duality in Parametric Convex Lexicographic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-3437-8_1openalex-snapshot
Lagrange Duality in Partly Convex Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-56496-3_8openalex-snapshot
Zermelo Navigation Problem with State Constraints
inferred← citeshttps://doi.org/10.1023/a:1010917903065openalex-snapshot
Stability in Linear Programming Models: An Index Set Approach
inferred← citeshttps://doi.org/10.1023/b:jogo.0000035004.66019.3bopenalex-snapshot
Saddle-Point Optimality: A Look Beyond Convexity
inferred← citeshttps://doi.org/10.1080/0233193021000015659openalex-snapshot
Convex Parametric Programming in Abstract Spaces
inferred← citeshttps://doi.org/10.1080/02331939908844440openalex-snapshot
Stable parametric programming*
inferred← citeshttps://doi.org/10.1109/oceans.2010.5664348openalex-snapshot
Autonomous underwater vehicle minimum-time navigation in a current field
inferred← citeshttps://doi.org/10.3182/20100915-3-de-3008.00050openalex-snapshot
Autonomous Underwater Vehicle Pursuit of Biological Specimens in the Open Ocean
inferred← citeshttps://doi.org/10.3182/20100915-3-de-3008.00051openalex-snapshot
Transverse Oscillations of an Underwater Beam-Cable System
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.