On the public citation graph

On the domination property in vector optimization

https://doi.org/10.1007/bf00936168
0 signed · 20 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.1007/bf00934467openalex-snapshot
On a domination property for vector maximization with respect to cones
inferredcites →https://doi.org/10.1007/bf00934609openalex-snapshot
On a domination property for vector maximization with respect to cones
inferredcites →https://doi.org/10.1007/bf01583782openalex-snapshot
Existence and characterization of efficient decisions with respect to cones

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-3623-6_12openalex-snapshot
Efficiency
inferred← citeshttps://doi.org/10.1007/bf00934467openalex-snapshot
On a domination property for vector maximization with respect to cones
inferred← citeshttps://doi.org/10.1007/bf01099463openalex-snapshot
A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions
inferred← citeshttps://doi.org/10.1007/bf01588781openalex-snapshot
Recession cones and the domination property in vector optimization
inferred← citeshttps://doi.org/10.1007/bf02192940openalex-snapshot
Extension of the Zorn lemma to general nontransitive binary relations
inferred← citeshttps://doi.org/10.1007/s10898-019-00761-6openalex-snapshot
Stability in unified semi-infinite vector optimization
inferred← citeshttps://doi.org/10.1007/s10957-019-01514-xopenalex-snapshot
Stability and Scalarization for a Unified Vector Optimization Problem
inferred← citeshttps://doi.org/10.1016/0022-247x(86)90061-2openalex-snapshot
The domination property in multicriteria optimization
inferred← citeshttps://doi.org/10.1016/s0076-5392(09)60314-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1051/ro/1994280100771openalex-snapshot
Sur la propriété de domination et l'existence de points Pareto-efficaces en optimisation vectorielle convexe
inferred← citeshttps://doi.org/10.1080/02331934.2018.1556663openalex-snapshot
External and internal stability in set optimization
inferred← citeshttps://doi.org/10.1080/02331934.2023.2181080openalex-snapshot
The point-based robustness gap for uncertain multiobjective optimization
inferred← citeshttps://doi.org/10.1080/02331934.2024.2323107openalex-snapshot
Notes on the value function approach to multiobjective bilevel optimization
inferred← citeshttps://doi.org/10.1080/02331938808843317openalex-snapshot
On the characterization of efficient points by means of monotone functionals
inferred← citeshttps://doi.org/10.1080/02331938908843500openalex-snapshot
Convexity of the optimal multifunctions and its consequences in vector optimization
inferred← citeshttps://doi.org/10.53846/goediss-6850openalex-snapshot
On Minmax Robustness for Multiobjective Optimization with Decision or Parameter Uncertainty
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.