On the public citation graph
On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
0 signed · 37 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/978-3-0348-5553-2_4openalex-snapshot
Parametrische Optimierung und Vektoroptimierung
inferredcites →https://doi.org/10.1007/978-3-322-96210-2_2openalex-snapshot
Topological Vector Spaces
inferredcites →https://doi.org/10.1007/978-3-642-46618-2_9openalex-snapshot
Parametric Optimization with a Bottleneck Objective and Vector Optimization
inferredcites →https://doi.org/10.1007/bf00932907openalex-snapshot
Connectedness of the set of nondominated outcomes in multicriteria optimization
inferredcites →https://doi.org/10.1007/bf00933830openalex-snapshot
Bicriteria linear fractional programming
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.1007/bf00940199openalex-snapshot
Parametric approximation problems arising in vector optimization
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.1080/01630568508816205openalex-snapshot
Pareto efficiency in locally convex spaces i
inferredcites →https://doi.org/10.1080/02331938408842951openalex-snapshot
On the connectedness of the set of efficient points n convex optimization problems with multiple or random Objectives
inferredcites →https://doi.org/10.1090/s0002-9939-1985-0806083-0openalex-snapshot
Structure of the efficient point set
inferredcites →https://doi.org/10.1137/0324017openalex-snapshot
Generalized Quasiconvex Mappings and Vector Optimization
inferredcites →https://doi.org/10.1287/mnsc.29.2.250openalex-snapshot
Connectedness in Multiple Linear Fractional Programming
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/978-1-4613-3341-8_23openalex-snapshot
Generalized Concavity in Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46854-4_15openalex-snapshot
Non-connected Efficiency Graphs in Multiple Criteria Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/bf01097002openalex-snapshot
On a constructive approximation of the efficient outcomes in bicriterion vector optimization
inferred← citeshttps://doi.org/10.1007/bf01246333openalex-snapshot
Connectedness of super efficient solution sets for set-valued maps in Banach spaces
inferred← citeshttps://doi.org/10.1007/s002459900065openalex-snapshot
Generalized Semicontinuity and Existence Theorems for Cone Saddle Points
inferred← citeshttps://doi.org/10.1007/s10255-004-0169-8openalex-snapshot
Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces
inferred← citeshttps://doi.org/10.1007/s10255-006-0352-1openalex-snapshot
On Connectedness of Efficient Solution Sets for a Star Cone-Quasiconvex Vector Optimization Problem
inferred← citeshttps://doi.org/10.1007/s10898-009-9452-9openalex-snapshot
Some properties of approximate solutions for vector optimization problem with set-valued functions
inferred← citeshttps://doi.org/10.1007/s10957-011-9849-8openalex-snapshot
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
inferred← citeshttps://doi.org/10.1016/0362-546x(93)90115-9openalex-snapshot
Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem
inferred← citeshttps://doi.org/10.1016/0362-546x(94)90095-7openalex-snapshot
Connectedness of the efficient solution set of a convex vector optimization in normed spaces
inferred← citeshttps://doi.org/10.1016/j.neunet.2024.106571openalex-snapshot
A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00116-6openalex-snapshot
Connectedness of efficient solutions in multiple criteria combinatorial optimization
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00203-1openalex-snapshot
The balance space approach to multicriteria decision making—involving the decision maker
inferred← citeshttps://doi.org/10.1142/9789812792907_0005openalex-snapshot
VECTOR-VALUED MINIMAX THEOREMS IN MULTICRITERIA GAMES
inferred← citeshttps://doi.org/10.22144/ctu.jvn.2023.006openalex-snapshot
Sự tồn tại nghiệm cho bài toán tối ưu vector dựa trên nón thứ tự kết hợp
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.