On the public citation graph
Approximation of the efficient point set by perturbation of the ordering cone
0 signed · 40 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.1002/zamm.19760560215openalex-snapshot
F. Nožiêka/J. Guddat/H. Hollatz/B. Bank, Theorie der linearen parametrischen Optimierung. 312 S., Berlin 1974. Akademie‐Verlag. Preis 52,‐ M
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0openalex-snapshot
Parametric Optimization and Approximation
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0_4openalex-snapshot
Application of Parametric Programming to the Optimal Design of Stiffened Plates
inferredcites →https://doi.org/10.1007/978-3-642-73778-7_149openalex-snapshot
A Method of Reference Point Approximation in Vector Optimization
inferredcites →https://doi.org/10.1007/978-3-642-83707-4_13openalex-snapshot
A Recursive Procedure for the Solution of Linear and Nonlinear Vector Optimization Problems
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/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
inferredcites →https://doi.org/10.1007/bf00934564openalex-snapshot
Scalarizing vector optimization problems
inferredcites →https://doi.org/10.1007/bf01447324openalex-snapshot
An interactive algorithm for nonlinear vector optimization
inferredcites →https://doi.org/10.1007/bf01719738openalex-snapshot
On the completeness and constructiveness of parametric characterizations to vector optimization problems
inferredcites →https://doi.org/10.1016/0022-247x(79)90226-9openalex-snapshot
An improved definition of proper efficiency for vector maximization with respect to cones
inferredcites →https://doi.org/10.1137/0134018openalex-snapshot
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
inferredcites →https://doi.org/10.1515/9781400881970-006openalex-snapshot
5. Admissible Points of Convex Sets
inferredcites →https://doi.org/10.1515/9783112471548openalex-snapshot
Theorie der linearen parametrischen Optimierung
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mcda.287openalex-snapshot
Piecewise quadratic approximation of the non‐dominated set for bi‐criteria programs
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_18openalex-snapshot
Continuous Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-89815-5_9openalex-snapshot
Ordering Structures and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_1openalex-snapshot
Variable Ordering Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_10openalex-snapshot
Outlook and Further Application Areas
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_2openalex-snapshot
Optimality Concepts and Their Characterization
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_6openalex-snapshot
Scalarizations for Variable Orderings Given by Bishop-Phelps Cones
inferred← citeshttps://doi.org/10.1007/978-3-642-54283-1_7openalex-snapshot
Optimality Conditions for Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-56656-1_2openalex-snapshot
Norm-Based Approximation in Convex Multicriteria Programming
inferred← citeshttps://doi.org/10.1007/bf01097002openalex-snapshot
On a constructive approximation of the efficient outcomes in bicriterion vector optimization
inferred← citeshttps://doi.org/10.1007/s10589-007-9155-4openalex-snapshot
Scalarizations for adaptively solving multi-objective optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-005-5494-4openalex-snapshot
Approximation Methods in Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/s10957-018-1289-2openalex-snapshot
A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1016/s0898-1221(02)00204-3openalex-snapshot
Norm-based approximation in multicriteria programming
inferred← citeshttps://doi.org/10.1023/a:1023993231971openalex-snapshot
Minimum Effort Approximation of the Pareto Space of Convex Bi-Criteria Problems
inferred← citeshttps://doi.org/10.1080/02331930412331282409openalex-snapshot
Geoffrion proper efficiency in an infinite dimensional space
inferred← citeshttps://doi.org/10.1090/s0002-9939-96-03162-0openalex-snapshot
On the density of proper efficient points
inferred← citeshttps://doi.org/10.1109/comst.2017.2698366openalex-snapshot
A Survey on Modeling and Optimizing Multi-Objective Systems
inferred← citeshttps://doi.org/10.1137/060672029openalex-snapshot
An Adaptive Scalarization Method in Multiobjective Optimization
inferred← citeshttps://doi.org/10.11650/twjm/1500405136openalex-snapshot
AN EVALUATION OF EFFICIENT POINTS FOR VECTOR OPTIMIZATION
inferred← citeshttps://doi.org/10.2514/6.1998-4961openalex-snapshot
Approximating Pareto curves using the hyper-ellipse
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.