On the public citation graph

Connectedness of the efficient set in strictly quasiconcave vector maximization

https://doi.org/10.1007/bf00939886
0 signed · 32 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/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/bf00932907openalex-snapshot
Connectedness of the set of nondominated outcomes in multicriteria optimization
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.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.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/978-1-4613-0299-5_29openalex-snapshot
Connectedness and Stability of the Solution Sets in Linear Fractional Vector Optimization Problems
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/bf01194174openalex-snapshot
A note on connectivity of efficient solution sets
inferred← citeshttps://doi.org/10.1007/bf02192541openalex-snapshot
On the connectedness of the efficient set for strictly quasiconvex vector minimization problems
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/s10957-004-1177-9openalex-snapshot
Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.06.077openalex-snapshot
On essential sets and essential components of efficient solutions for vector optimization problems
inferred← citeshttps://doi.org/10.1017/s0004972700037230openalex-snapshot
S-strictly quasi-concave vector maximisation
inferred← citeshttps://doi.org/10.1023/a:1008270131268openalex-snapshot
Efficiency and Solution Approaches to Bicriteria Nonconvex Programs
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: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/02331930500096270openalex-snapshot
Connectedness of efficient points in convex and convex transformable vector optimization
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.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.4064/am-25-1-121-127openalex-snapshot
On the connectivity of efficient point sets
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.