On the public citation graph
Stability results for approximately efficient solutions
0 signed · 29 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-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5_6openalex-snapshot
On Procedures for Analysing Parametric Optimization Problems
inferredcites →https://doi.org/10.1007/bf00934564openalex-snapshot
Scalarizing vector optimization problems
inferredcites →https://doi.org/10.1007/bf00936165openalex-snapshot
?-solutions in vector minimization problems
inferredcites →https://doi.org/10.1007/bf00938314openalex-snapshot
On two generalizations of Pareto minimality
inferredcites →https://doi.org/10.1007/bf00940478openalex-snapshot
Nonconvex separation theorems and some applications in vector optimization
inferredcites →https://doi.org/10.1007/bf00941178openalex-snapshot
Continuous dependence of solutions on a parameter in a scalarization method
inferredcites →https://doi.org/10.1080/02331938908843483openalex-snapshot
Between Pareto efficiency and Pareto ε-efficiency
inferredcites →https://doi.org/10.1080/02331939208843815openalex-snapshot
A generalization of ekellandz’s variational principle
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.1007/0-306-48107-3_1openalex-snapshot
Theory of Vector Optimization
inferred← citeshttps://doi.org/10.1007/0-387-30065-1_11openalex-snapshot
Conditions and parametric representations of approximate minimal elements of a set through scalarization
inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_16openalex-snapshot
Optimality Conditions for Tanaka’s Approximate Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-46854-4_37openalex-snapshot
Location of a Semiobnoxious Facility. A Biobjective Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-59132-7_1openalex-snapshot
An Algorithm for Vectorial Control Approximation Problems
inferred← citeshttps://doi.org/10.1007/s10013-014-0103-1openalex-snapshot
Concepts for Approximate Solutions of Vector Optimization Problems with Variable Order Structures
inferred← citeshttps://doi.org/10.1007/s10107-016-1075-6openalex-snapshot
Random approximations in multiobjective optimization
inferred← citeshttps://doi.org/10.1007/s10589-006-8718-0openalex-snapshot
On Approximate Solutions in Vector Optimization Problems Via Scalarization
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/s10898-022-01232-1openalex-snapshot
Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions
inferred← citeshttps://doi.org/10.1007/s10957-007-9191-3openalex-snapshot
Optimality Conditions for Metrically Consistent Approximate Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-014-0535-5openalex-snapshot
Characterization of Approximate Solutions of Vector Optimization Problems with a Variable Order Structure
inferred← citeshttps://doi.org/10.1007/s11590-018-1292-4openalex-snapshot
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.10.023openalex-snapshot
Generating ε-efficient solutions in multiobjective programming
inferred← citeshttps://doi.org/10.1080/0233193021000058959openalex-snapshot
A New Variant of Ekeland's Variational Principle for Set-Valued Maps
inferred← citeshttps://doi.org/10.1080/02331930802355374openalex-snapshot
ε-Conjugate maps andε-conjugate duality in vector optimization with set-valued maps
inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1080/03052150802086714openalex-snapshot
Local Pareto approximation for multi-objective optimization
inferred← citeshttps://doi.org/10.1137/05062648xopenalex-snapshot
A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
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.