On the public citation graph

Complete efficiency and interdependencies between objective functions in vector optimization

https://doi.org/10.1007/bf01415973
0 signed · 16 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/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf01593795openalex-snapshot
Testing for complete efficiency in a vector maximization problem
inferredcites →https://doi.org/10.1016/s0076-5392(09)x6017-0openalex-snapshot
Theory of Multiobjective Optimization
inferredcites →https://doi.org/10.1057/jors.1983.104openalex-snapshot
Optimality and Efficiency
inferredcites →https://doi.org/10.1080/02331938808843317openalex-snapshot
On the characterization of efficient points by means of monotone functionals

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_2openalex-snapshot
Nonlinear Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/0-387-23081-5_17openalex-snapshot
Mutiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_18openalex-snapshot
Continuous Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-36510-5_20openalex-snapshot
Cones to Aid Decision Making in Multicriteria Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-56680-6_18openalex-snapshot
Problems in Scalarizing Multicriteria Approaches
inferred← citeshttps://doi.org/10.1007/bf00940478openalex-snapshot
Nonconvex separation theorems and some applications in vector optimization
inferred← citeshttps://doi.org/10.1007/s10957-007-9235-8openalex-snapshot
Cone Characterizations of Approximate Solutions in Real Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-026-03103-1openalex-snapshot
Efficiency-Preserving Transformations in Multiobjective Optimization: Characterizations and Effect on Trade-Off Bounds
inferred← citeshttps://doi.org/10.1080/02331934.2018.1474469openalex-snapshot
New algorithms for discrete vector optimization based on the Graef-Younes method and cone-monotone sorting functions
inferred← citeshttps://doi.org/10.1080/02331939208843858openalex-snapshot
Countably orderable sets and their applications in optimization
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.