On the public citation graph
On duality in the vectorial control-approximation problem
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.1002/zamm.19790590621openalex-snapshot
Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1)
inferredcites →https://doi.org/10.1007/978-3-642-46618-2_6openalex-snapshot
Sets of Efficiency in a Normed Space and Inner Product
inferredcites →https://doi.org/10.1007/bf00939816openalex-snapshot
Strong duality for infinite-dimensional vector-valued programming problems
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1016/0022-247x(86)90237-4openalex-snapshot
Sets of efficient points in a normed space
inferredcites →https://doi.org/10.1016/0377-2217(81)90197-1openalex-snapshot
Finding efficient solutions for rectilinear distance location problems efficiently
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1080/02331938308842896openalex-snapshot
Zur vektoriellen linearen Tschebyscheff-Approximation
inferredcites →https://doi.org/10.1080/02331938808843369openalex-snapshot
Dualität und algorithmische anwendung beim vektoriellen standortproblem
inferredcites →https://doi.org/10.1080/05695557708975152openalex-snapshot
Efficient Points in Location Problems
inferredcites →https://doi.org/10.1137/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1287/moor.6.2.159openalex-snapshot
Duality for Multiple Objective Convex Programs
inferredcites →https://doi.org/10.1287/opre.29.6.1219openalex-snapshot
Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
inferredcites →https://doi.org/10.2307/3323470openalex-snapshot
Lecture Notes in Economics and Mathematical Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jmaa.2001.7749openalex-snapshot
Some Deterministic and Random Vector Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_1openalex-snapshot
Theory of Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-322-81539-2_14openalex-snapshot
Standortprobleme in der Landschaftsgestaltung
inferred← citeshttps://doi.org/10.1007/bf01415910openalex-snapshot
Generalization and sharpening of some duality relations for a class of vector optimization problems
inferred← citeshttps://doi.org/10.1007/bf01719704openalex-snapshot
Kolmogorov-conditions for vectorial approximation problems
inferred← citeshttps://doi.org/10.1007/bf01720319openalex-snapshot
Properly efficient solutions for vectorial norm approximation
inferred← citeshttps://doi.org/10.1007/bfb0113272openalex-snapshot
Duality results for convex vector optimization problems with linear restrictions
inferred← citeshttps://doi.org/10.1016/0362-546x(93)90052-topenalex-snapshot
Vector variational inequality and its duality
inferred← citeshttps://doi.org/10.1023/a:1004622204554openalex-snapshot
Multiobjective Control Approximation Problems: Duality and Optimality
inferred← citeshttps://doi.org/10.1080/02331939108843717openalex-snapshot
Duality in vectorial control approximation problems with inequality restrictions
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.