On the public citation graph

Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives

https://doi.org/10.1007/bf00933970
0 signed · 132 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/10957.1573-2878openalex-snapshot
Journal of Optimization Theory and Applications
inferredcites →https://doi.org/10.1007/978-3-642-87563-2_5openalex-snapshot
On the Relationship of the Tchebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives
inferredcites →https://doi.org/10.1007/bf00932907openalex-snapshot
Connectedness of the set of nondominated outcomes in multicriteria optimization
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1016/0022-247x(75)90189-4openalex-snapshot
The set of all nondominated solutions in linear cases and a multicriteria simplex method
inferredcites →https://doi.org/10.1016/0377-2217(81)90272-1openalex-snapshot
Fractional programming: Applications and algorithms
inferredcites →https://doi.org/10.1057/jors.1979.48openalex-snapshot
Multicriteria Programming for Financial Planning
inferredcites →https://doi.org/10.1287/mnsc.19.4.357openalex-snapshot
An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
inferredcites →https://doi.org/10.1287/mnsc.27.9.1024openalex-snapshot
Multiple Objective Linear Fractional Programming
inferredcites →https://doi.org/10.1287/mnsc.29.2.250openalex-snapshot
Connectedness in Multiple Linear Fractional Programming
inferredcites →https://doi.org/10.14288/1.0095251openalex-snapshot
Topics in multiple criteria optimization
inferredcites →https://doi.org/10.2307/2553559openalex-snapshot
Introduction to Equilibrium Analysis.
inferredcites →https://doi.org/10.2307/3008471openalex-snapshot
Multiple Criteria Decision Making.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1099-1360(199909)8:5<268::aid-mcda252>3.0.co;2-gopenalex-snapshot
Multi-criteria minisum facility location problems
inferred← citeshttps://doi.org/10.1002/1099-1360(199911)8:6<322::aid-mcda260>3.0.co;2-5openalex-snapshot
Multiple objective programming with piecewise linear functions
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1002/mana.201400323openalex-snapshot
Topologically-based characterizations of the existence of solutions of optimization-related problems
inferred← citeshttps://doi.org/10.1002/mcda.303openalex-snapshot
Robustness in the Pareto‐solutions for the multi‐criteria minisum location problem
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/0-306-48332-7_155openalex-snapshot
Generalized Concavity in Multi-Objective Optimization
inferred← citeshttps://doi.org/10.1007/0-387-23081-5_17openalex-snapshot
Mutiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_202openalex-snapshot
Generalized Concavity in Multi-objective Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-0299-5_13openalex-snapshot
Super Efficiency for a Vector Equilibrium in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1007/978-1-4613-0299-5_28openalex-snapshot
On Monotone and Strongly Monotone Vector Variational Inequalities
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/978-1-4757-3623-6_12openalex-snapshot
Efficiency
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_1openalex-snapshot
Scalar and Vector Generalized Convexity
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_18openalex-snapshot
Continuous Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-32177-2_9openalex-snapshot
Location Problems with Multiple Criteria
inferred← citeshttps://doi.org/10.1007/978-3-031-43254-5_18openalex-snapshot
Computational Complexity of k-Stable Matchings
inferred← citeshttps://doi.org/10.1007/978-3-319-13111-5_9openalex-snapshot
Location Problems with Multiple Criteria
inferred← citeshttps://doi.org/10.1007/978-3-540-36510-5_26openalex-snapshot
On Affine Vector Variational Inequality
inferred← citeshttps://doi.org/10.1007/978-3-642-21114-0_9openalex-snapshot
Linear Fractional and Convex Quadratic Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_148openalex-snapshot
Zum Derzeitigen Stand Mathematischer Untersuchungen für Vektoroptimierungsprobleme
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/978-3-642-46854-4_40openalex-snapshot
Finding Efficient Points in Multiobjective Quadratic Programming with Strictly Convex Objective Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-60667-0_17openalex-snapshot
Some Optimality Conditions in Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-981-13-9267-2_47openalex-snapshot
SWaP-C Based Comparison of Onboard Computers for Unmanned Vehicles
inferred← citeshttps://doi.org/10.1007/bf00939046openalex-snapshot
Scalarization of vector optimization problems
inferred← citeshttps://doi.org/10.1007/bf00939886openalex-snapshot
Connectedness of the efficient set in strictly quasiconcave vector maximization
inferred← citeshttps://doi.org/10.1007/bf00940308openalex-snapshot
Characterizing the nondominated set by separable functions
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/bf01102345openalex-snapshot
On the connectedness of the set of weakly efficient points of a vector optimization problem in locally convex spaces
inferred← citeshttps://doi.org/10.1007/bf01194174openalex-snapshot
A note on connectivity of efficient solution sets
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/bf02191763openalex-snapshot
Connectedness of efficient solution sets for set-valued maps in normed spaces
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/pl00020915openalex-snapshot
Connectedness of super efficient sets in vector optimization of set-valued maps
inferred← citeshttps://doi.org/10.1007/s001860200207openalex-snapshot
On the number of criteria needed to decide Pareto optimality
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-9032-1openalex-snapshot
Unbounded Components in the Solution Sets of Strictly Quasiconcave Vector Maximization Problems
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-005-5502-8openalex-snapshot
Multicriteria Planar Ordered Median Problems
inferred← citeshttps://doi.org/10.1007/s10957-007-9196-yopenalex-snapshot
Connectedness of the Solution Sets and Scalarization for Vector Equilibrium Problems
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.1007/s10957-012-0129-zopenalex-snapshot
On Essential Stable Sets of Solutions in Set Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-018-1244-2openalex-snapshot
Connectedness of Solution Sets of Strong Vector Equilibrium Problems with an Application
inferred← citeshttps://doi.org/10.1007/s11117-024-01054-3openalex-snapshot
Approximate Benson properly efficient solutions for set-valued 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/s11228-017-0423-xopenalex-snapshot
Connectedness of Approximate Efficient Solutions for Generalized Semi-Infinite Vector Optimization Problems
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/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization
inferred← citeshttps://doi.org/10.1016/0362-546x(90)90057-nopenalex-snapshot
Contractibility of efficient point sets in normed spaces
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/b978-044450550-7/50006-5openalex-snapshot
Vector Optimization
inferred← citeshttps://doi.org/10.1016/j.clsr.2015.08.004openalex-snapshot
Key government agency perspectives on location based services regulation
inferred← citeshttps://doi.org/10.1016/j.cor.2006.05.002openalex-snapshot
Quasiconvex constrained multicriteria continuous location problems: Structure of nondominated solution sets
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.033openalex-snapshot
Multiple objective minimum cost flow problems: A review
inferred← citeshttps://doi.org/10.1016/j.ins.2015.06.037openalex-snapshot
On the estimation of Pareto fronts from the point of view of copula theory
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.1016/j.na.2005.03.050openalex-snapshot
On solution sets for affine vector variational inequality
inferred← citeshttps://doi.org/10.1016/j.na.2005.08.029openalex-snapshot
Continuity properties of solutions of vector optimization
inferred← citeshttps://doi.org/10.1016/j.na.2010.06.048openalex-snapshot
On the stability of the solution for multiobjective generalized games with the payoffs perturbed
inferred← citeshttps://doi.org/10.1016/j.orl.2008.02.005openalex-snapshot
Weakly and properly nonessential objectives in multiobjective optimization problems
inferred← citeshttps://doi.org/10.1016/j.trb.2009.10.002openalex-snapshot
Properties of Pareto-efficient contracts and regulations for road franchising
inferred← citeshttps://doi.org/10.1016/s0076-5392(09)60314-3openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s0377-2217(00)00288-5openalex-snapshot
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry
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/s0377-2217(97)00184-7openalex-snapshot
Efficiency in constrained continuous location
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.1023/a:1004649928081openalex-snapshot
Contractibility and Connectedness of Efficient Point Sets
inferred← citeshttps://doi.org/10.1023/a:1008270131268openalex-snapshot
Efficiency and Solution Approaches to Bicriteria Nonconvex Programs
inferred← citeshttps://doi.org/10.1023/a:1017599614183openalex-snapshot
Efficient Sets of Convex Compacta are Arcwise Connected
inferred← citeshttps://doi.org/10.1023/a:1020905820371openalex-snapshot
Geometrical Description of the Weakly Efficient Solution Set for Multicriteria Location Problems
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.1023/a:1026412918497openalex-snapshot
Connectedness of Cone Superefficient Point Sets in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1023/a:1026418122905openalex-snapshot
Efficiency and Henig Efficiency for Vector Equilibrium Problems
inferred← citeshttps://doi.org/10.1080/01630563.2016.1176929openalex-snapshot
Lower Semicontinuity Results in Parametric Multivalued Weak Vector Equilibrium Problems and Applications
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/02331934.2010.505650openalex-snapshot
Monotone affine vector variational inequalities
inferred← citeshttps://doi.org/10.1080/02331934.2014.888556openalex-snapshot
Gap functions for vector variational inequalities
inferred← citeshttps://doi.org/10.1080/02331934.2020.1870686openalex-snapshot
A unified study of existence theorems in topologically based settings and applications in optimization
inferred← citeshttps://doi.org/10.1080/02331938608843122openalex-snapshot
Selection of Efficient Points
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/03088839.2021.1958020openalex-snapshot
A bi-objective programming model for loading finished-vehicles in containers with adjustable brackets
inferred← citeshttps://doi.org/10.1080/09720502.2005.10700386openalex-snapshot
A note on the connectedness of the efficient frontier
inferred← citeshttps://doi.org/10.1090/s0002-9939-1985-0806083-0openalex-snapshot
Structure of the efficient point set
inferred← citeshttps://doi.org/10.1109/eptc.2008.4763433openalex-snapshot
Pareto-Optimal Die Orientations for 3-D Stacking of Identical Dies
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.1145/3708507openalex-snapshot
Computational Complexity of k -stable Matchings
inferred← citeshttps://doi.org/10.1155/2008/581849openalex-snapshot
Connectedness and Compactness of Weak Efficient Solutions for Set-Valued Vector Equilibrium Problems
inferred← citeshttps://doi.org/10.1155/2009/928968openalex-snapshot
A Note on Essential Components and Essential Weakly Efficient Solutions for Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1155/2012/183040openalex-snapshot
The Convergent Behavior for Parametric Generalized Vector Equilibrium Problems
inferred← citeshttps://doi.org/10.1155/2012/310818openalex-snapshot
Minimax Theorems for Set‐Valued Mappings under Cone‐Convexities
inferred← citeshttps://doi.org/10.1155/2013/245485openalex-snapshot
Variational Inequalities and Vector Optimization
inferred← citeshttps://doi.org/10.1155/2013/431717openalex-snapshot
Connectedness of Solution Sets for Weak Vector Variational Inequalities on Unbounded Closed Convex Sets
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.11650/twjm/1500405407openalex-snapshot
CONNECTEDNESS AND PATH-CONNECTEDNESS OF SOLUTION SETS TO SYMMETRIC VECTOR EQUILIBRIUM PROBLEMS
inferred← citeshttps://doi.org/10.1186/1687-1812-2011-36openalex-snapshot
Connectedness of approximate solutions set for vector equilibrium problems in Hausdorff topological vector spaces
inferred← citeshttps://doi.org/10.1287/moor.22.2.291openalex-snapshot
Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
inferred← citeshttps://doi.org/10.1287/opre.1070.0502openalex-snapshot
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
inferred← citeshttps://doi.org/10.1287/opre.50.4.670.2857openalex-snapshot
A Bi-Objective Median Location Problem With a Line Barrier
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.22144/ctu.jvn.2023.088openalex-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 tập không lồi
inferred← citeshttps://doi.org/10.23952/asvao.4.2022.1.08openalex-snapshot
The connectedness of weakly and strongly efficient solution sets of nonconvex vector equilibrium problems
inferred← citeshttps://doi.org/10.23952/jano.4.2022.1.05openalex-snapshot
A new class of vector optimization problems with linear fractional objective criteria
inferred← citeshttps://doi.org/10.2478/s12175-011-0077-3openalex-snapshot
Connectedness of the sets of weak efficient solutions for generalized vector equilibrium problems
inferred← citeshttps://doi.org/10.2991/icence-16.2016.140openalex-snapshot
Connectedness of approximate weak efficient sets for the set-vector equilibrium problem
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
inferred← citeshttps://doi.org/10.4134/ckms.2003.18.4.587openalex-snapshot
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
inferred← citeshttps://doi.org/10.48550/arxiv.1511.06606openalex-snapshot
Data Representation and Compression Using Linear-Programming Approximations
inferred← citeshttps://doi.org/10.48550/arxiv.1808.00935openalex-snapshot
Inferring Parameters Through Inverse Multiobjective Optimization
inferred← citeshttps://doi.org/10.51415/10321/2466openalex-snapshot
Synthesis of a model for optimising a potable water treatment plant and water usage analysis in the Ugu District
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.