On the public citation graph
Characterization of solutions of multiobjective optimization problem
0 signed · 25 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-3-642-50280-4openalex-snapshot
Theory of Vector Optimization
inferredcites →https://doi.org/10.1007/978-94-015-8472-2openalex-snapshot
Recent Developments in Well-Posed Variational Problems
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.1007/bf02191776openalex-snapshot
On the notion of proper efficiency in vector optimization
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1080/01630569408816587openalex-snapshot
On lagrange-kuhn-tucker multipliers for pareto optimization problems
inferredcites →https://doi.org/10.1080/02331939708844332openalex-snapshot
On Lagrance-Kuhn-Tucker Mulitipliers for Muliobjective Optimization Problems
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.4.1.79openalex-snapshot
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_27openalex-snapshot
First-Order Conditions for C 0,1 Constrained Vector Optimization
inferred← citeshttps://doi.org/10.1007/bf03031435openalex-snapshot
Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
inferred← citeshttps://doi.org/10.1007/s10492-006-0002-1openalex-snapshot
From Scalar to Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10898-017-0582-1openalex-snapshot
Scalarizations for a unified vector optimization problem based on order representing and order preserving properties
inferred← citeshttps://doi.org/10.1007/s10957-005-4723-1openalex-snapshot
Well-Posedness and Scalarization in Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-012-0027-4openalex-snapshot
Nonlinear Separation Approach to Constrained Extremum Problems
inferred← citeshttps://doi.org/10.1007/s10957-012-0106-6openalex-snapshot
Stability and Scalarization of Weak Efficient, Efficient and Henig Proper Efficient Sets Using Generalized Quasiconvexities
inferred← citeshttps://doi.org/10.1007/s10957-012-0242-zopenalex-snapshot
Optimality Conditions for Generalized Ky Fan Quasi-Inequalities with Applications
inferred← citeshttps://doi.org/10.1007/s10957-014-0686-4openalex-snapshot
Stability and Scalarization in Vector Optimization Using Improvement Sets
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.01.041openalex-snapshot
Isolated minimizers and proper efficiency for C0,1 constrained vector optimization problems
inferred← citeshttps://doi.org/10.1023/a:1016031214488openalex-snapshot
Scalarization and Stability in Vector Optimization
inferred← citeshttps://doi.org/10.1080/02331934.2015.1014479openalex-snapshot
A new nonlinear scalarization function and applications
inferred← citeshttps://doi.org/10.1137/s0363012902411532openalex-snapshot
Degrees of Efficiency and Degrees of Minimality
inferred← citeshttps://doi.org/10.1155/2013/570918openalex-snapshot
Strict Efficiency in Vector Optimization with Nearly Convexlike Set-Valued Maps
inferred← citeshttps://doi.org/10.3390/sym14061169openalex-snapshot
A Pareto–Pontryagin Maximum Principle for Optimal Control
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.