On the public citation graph
Connectedness of super efficient sets in vector optimization of set-valued maps
0 signed · 25 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-1-4615-8768-2_3openalex-snapshot
Generalization of Domination Structures and Nondominated Solutions in Multicriteria Decision Making
inferredcites →https://doi.org/10.1007/978-1-4684-8395-6openalex-snapshot
Multiple-Criteria Decision Making: "Concepts, Techniques, And Extensions"
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00933970openalex-snapshot
Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1016/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization
inferredcites →https://doi.org/10.1016/0022-247x(91)90402-lopenalex-snapshot
Contractibility and generalized convexity
inferredcites →https://doi.org/10.1016/0362-546x(90)90057-nopenalex-snapshot
Contractibility of efficient point sets in normed spaces
inferredcites →https://doi.org/10.1016/0362-546x(93)90115-9openalex-snapshot
Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem
inferredcites →https://doi.org/10.1515/9781400881970-006openalex-snapshot
5. Admissible Points of Convex Sets
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.7680openalex-snapshot
On the Contractibility and Connectedness of an Efficient Point Set
inferred← citeshttps://doi.org/10.1007/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/s10957-011-9906-3openalex-snapshot
Connectedness of Henig Weakly Efficient Solution Set for Set-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11228-017-0423-xopenalex-snapshot
Connectedness of Approximate Efficient Solutions for Generalized Semi-Infinite Vector Optimization Problems
inferred← citeshttps://doi.org/10.1016/j.chaos.2023.113454openalex-snapshot
Devaney chaos of a set-valued map and its inverse limit
inferred← citeshttps://doi.org/10.1016/j.orl.2019.03.005openalex-snapshot
Arcwise connectedness of the solution sets for set optimization problems
inferred← citeshttps://doi.org/10.1016/j.orl.2020.10.002openalex-snapshot
Connectedness of weak minimal solution set for set optimization problems
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1080/02331934.2021.1969393openalex-snapshot
Connectedness of the approximate solution sets for set optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2023.2170701openalex-snapshot
Hadamard well-posedness for a set optimization problem with an infinite number of constraints
inferred← citeshttps://doi.org/10.3934/eect.2017022openalex-snapshot
Sensitivity analysis in set-valued optimization under strictly minimal efficiency
inferred← citeshttps://doi.org/10.3934/jimo.2016019openalex-snapshot
Higher-order sensitivity analysis in set-valued optimization under Henig efficiency
inferred← citeshttps://doi.org/10.3934/naco.2014.4.309openalex-snapshot
Topological properties of Henig globally efficient solutions of set-valued problems
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.