On the public citation graph
Density of the set of positive proper minimal points in the set of minimal points
0 signed · 36 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-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
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/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1007/bf00934893openalex-snapshot
Maximal points with respect to cone dominance in Banach spaces and their existence
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/0022-0531(70)90022-0openalex-snapshot
Some approximation theorems on efficiency prices for infinite programs
inferredcites →https://doi.org/10.1080/02331938008842650openalex-snapshot
The geometry of Pareto efficiency over cones
inferredcites →https://doi.org/10.1137/0134018openalex-snapshot
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
inferredcites →https://doi.org/10.1137/0326055openalex-snapshot
A Generalization of a Theorem of Arrow, Barankin, and Blackwell
inferredcites →https://doi.org/10.1137/0328008openalex-snapshot
Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory
inferredcites →https://doi.org/10.1137/0328021openalex-snapshot
On a Theorem of Arrow, Barankin, and Blackwell
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.1998.6218openalex-snapshot
Some More Density Results for Proper Efficiencies
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_9openalex-snapshot
Arrow-Barankin-Blackwell Theorems and Related Results in Cone Duality: A Survey
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/s10898-025-01550-0openalex-snapshot
POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION
inferred← citeshttps://doi.org/10.1007/s10957-014-0644-1openalex-snapshot
On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1007/s10957-025-02836-9openalex-snapshot
Symmetric and Non-symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
inferred← citeshttps://doi.org/10.1007/s11228-006-0028-2openalex-snapshot
Conic Set-Valued Maps in Vector Optimization
inferred← citeshttps://doi.org/10.1007/s11590-022-01968-5openalex-snapshot
Pareto efficiency without topology
inferred← citeshttps://doi.org/10.1007/s13398-019-00650-3openalex-snapshot
On dentability and cones with a large dual
inferred← citeshttps://doi.org/10.1007/s13398-021-01054-yopenalex-snapshot
Denting points of convex sets and weak property ($$\pi $$) of cones in locally convex spaces
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.06.029openalex-snapshot
Some geometrical aspects of the efficient line in vector optimization
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.06.093openalex-snapshot
Geometry of cones and an application in the theory of Pareto efficient points
inferred← citeshttps://doi.org/10.1016/j.jmaa.2015.06.029openalex-snapshot
On geometry of cones and some applications
inferred← citeshttps://doi.org/10.1016/s0022-247x(03)00013-1openalex-snapshot
Characterizations of some remarkable classes of cones
inferred← citeshttps://doi.org/10.1016/s0362-546x(01)00760-xopenalex-snapshot
A note on lower semicontinuity of minimal points
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00296-4openalex-snapshot
Density theorems for ideal points in vector optimization
inferred← citeshttps://doi.org/10.1080/02331930412331282427openalex-snapshot
A new ABB theorem in normed vector spaces
inferred← citeshttps://doi.org/10.1080/02331934.2019.1616731openalex-snapshot
A set-valued Lagrange theorem based on a process for convex vector programming
inferred← citeshttps://doi.org/10.1080/02331934.2021.2009825openalex-snapshot
Density and connectedness of optimal points with respect to improvement sets
inferred← citeshttps://doi.org/10.1080/02331934.2024.2417937openalex-snapshot
Existence and density theorems of Henig global proper efficient points
inferred← citeshttps://doi.org/10.1155/2008/231845openalex-snapshot
Some Characterizations of Ideal Points in Vector Optimization Problems
inferred← citeshttps://doi.org/10.1214/105051606000000880openalex-snapshot
On the density of properly maximal claims in financial markets with transaction costs
inferred← citeshttps://doi.org/10.23952/jnva.7.2023.6.03openalex-snapshot
Weak Henig proper solution sets for set optimization 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.