On the public citation graph

Connectedness of super efficient solution sets for set-valued maps in Banach spaces

https://doi.org/10.1007/bf01246333
0 signed · 24 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/b114992openalex-snapshot
Applied Nonlinear Analysis
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/bf01102345openalex-snapshot
On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
inferredcites →https://doi.org/10.1007/bf01415905openalex-snapshot
Super efficiency in convex vector optimization
inferredcites →https://doi.org/10.1007/bf02191763openalex-snapshot
Connectedness of efficient solution sets for set-valued maps in normed spaces
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.1090/s0002-9947-1993-1098432-5openalex-snapshot
Super Efficiency in Vector Optimization
inferredcites →https://doi.org/10.1112/blms/17.5.487openalex-snapshot
APPLIED NONLINEAR ANALYSIS

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
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/bf01194174openalex-snapshot
A note on connectivity of efficient solution sets
inferred← citeshttps://doi.org/10.1007/bf02670960openalex-snapshot
Super efficiency and its scalarization in topological vector space
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/s11590-022-01943-0openalex-snapshot
Connectedness of the solution sets in generalized semi-infinite set optimization
inferred← citeshttps://doi.org/10.1007/s12215-025-01255-zopenalex-snapshot
Existence and Arcwise connectedness of Robust solutions for uncertain generalized multi-objective optimization problems
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.1023/a:1026412918497openalex-snapshot
Connectedness of Cone Superefficient Point Sets in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1080/02331934.2015.1044899openalex-snapshot
The connectedness of the solutions set for generalized vector equilibrium problems
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/02331939708844267openalex-snapshot
Connectivity of efficient solution sets in vector optimization of set-valued mappings
inferred← citeshttps://doi.org/10.22436/jnsa.010.06.37openalex-snapshot
Strong duality with super efficiency in set-valued optimization
inferred← citeshttps://doi.org/10.3934/naco.2014.4.309openalex-snapshot
Topological properties of Henig globally efficient solutions of set-valued problems
inferred← citeshttps://doi.org/10.4064/am-25-1-121-127openalex-snapshot
On the connectivity of efficient point sets
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.