On the public citation graph

On the connectedness of the efficient set for strictly quasiconvex vector minimization problems

https://doi.org/10.1007/bf02192541
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.
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/bf00933970openalex-snapshot
Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives
inferredcites →https://doi.org/10.1007/bf00939886openalex-snapshot
Connectedness of the efficient set in strictly quasiconcave vector maximization
inferredcites →https://doi.org/10.1007/bf01262931openalex-snapshot
On functions whose local minima are global
inferredcites →https://doi.org/10.1016/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization

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.1999.6541openalex-snapshot
New Closedness Results for Efficient Sets in Multiple Objective Mathematical Programming
inferred← citeshttps://doi.org/10.1006/jmaa.2000.6814openalex-snapshot
Arcwise Connectedness of Closed Efficient Point Sets
inferred← citeshttps://doi.org/10.1007/0-387-23393-8_5openalex-snapshot
Generalized Convexity in Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_20openalex-snapshot
Quasiconcavity of Sets and Connectedness of the Efficient Frontier in Ordered Vector Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_23openalex-snapshot
Generalized Concavity in Multiobjective Programming
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-006-9085-1openalex-snapshot
Explicitly quasiconvex set-valued optimization
inferred← citeshttps://doi.org/10.1007/s10898-024-01438-5openalex-snapshot
Unboundedness of the images of set-valued mappings having closed graphs: application to vector optimization
inferred← citeshttps://doi.org/10.1007/s10957-004-1177-9openalex-snapshot
Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains
inferred← citeshttps://doi.org/10.1007/s10957-016-1032-9openalex-snapshot
Existence and Connectedness of Solutions for Generalized Vector Quasi-Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/s11228-009-0120-5openalex-snapshot
Pareto Solutions of Polyhedral-valued Vector Optimization Problems in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s11425-008-0021-3openalex-snapshot
The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
inferred← citeshttps://doi.org/10.1007/s11590-021-01841-xopenalex-snapshot
Connectedness properties of the efficient sets and the nondominated sets to vector 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.1016/j.orl.2020.10.002openalex-snapshot
Connectedness of weak minimal solution set for set optimization problems
inferred← citeshttps://doi.org/10.1017/s0004972700037230openalex-snapshot
S-strictly quasi-concave vector maximisation
inferred← citeshttps://doi.org/10.1023/a:1014857230393openalex-snapshot
Maximizing a Linear Fractional Function on a Pareto Efficient Frontier
inferred← citeshttps://doi.org/10.1023/a:1017527329601openalex-snapshot
Contractibility of the Efficient Set in Strictly Quasiconcave Vector Maximization
inferred← citeshttps://doi.org/10.1023/a:1017599614183openalex-snapshot
Efficient Sets of Convex Compacta are Arcwise Connected
inferred← citeshttps://doi.org/10.1023/a:1022448811953openalex-snapshot
Contractibility of Efficient Frontier of Simply Shaded Sets
inferred← citeshttps://doi.org/10.1023/a:1022616612527openalex-snapshot
Connectedness of the Efficient Set for Strictly Quasiconcave Sets
inferred← citeshttps://doi.org/10.1023/a:1022634827916openalex-snapshot
Connectedness of the Efficient Set for Three-Objective Quasiconcave Maximization Problems
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/09720502.2005.10700386openalex-snapshot
A note on the connectedness of the efficient frontier
inferred← citeshttps://doi.org/10.1109/gsis.2011.6044093openalex-snapshot
The connected of generalized α-major optimal solution set for multiobjective decison-making
inferred← citeshttps://doi.org/10.1155/2013/619206openalex-snapshot
Structure of Pareto Solutions of Generalized Polyhedral-Valued Vector Optimization Problems in Banach Spaces
inferred← citeshttps://doi.org/10.22144/ctu.jvn.2022.145openalex-snapshot
Tính liên thông của tập nghiệm hữu hiệu yếu cho bài toán tối ưu vector không lồi
inferred← citeshttps://doi.org/10.3934/jimo.2016.12.1135openalex-snapshot
Some characterizations of the approximate solutions to generalized vector equilibrium problems
inferred← citeshttps://doi.org/10.4236/am.2012.330199openalex-snapshot
An Application of the Maximum Theorem in Multi-Criteria Optimization, Properties of Pareto-Retract Mappings, and the Structure of Pareto 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.