On the public citation graph
On a constructive approximation of the efficient outcomes in bicriterion vector optimization
0 signed · 32 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/nav.3800370305openalex-snapshot
An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming
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/bf00932518openalex-snapshot
On convex vectorial optimization in linear spaces
inferredcites →https://doi.org/10.1007/bf00933245openalex-snapshot
Vector maximization with two objective functions
inferredcites →https://doi.org/10.1007/bf00933455openalex-snapshot
On convex vectorial optimization in linear spaces
inferredcites →https://doi.org/10.1007/bf00933830openalex-snapshot
Bicriteria linear fractional programming
inferredcites →https://doi.org/10.1007/bf00934564openalex-snapshot
Scalarizing vector optimization problems
inferredcites →https://doi.org/10.1007/bf00939840openalex-snapshot
Interactive bicriterion solution method and its application to critical path method problems
inferredcites →https://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
inferredcites →https://doi.org/10.1007/bf01415907openalex-snapshot
Approximation of the efficient point set by perturbation of the ordering cone
inferredcites →https://doi.org/10.1007/bf02591870openalex-snapshot
An interactive weighted Tchebycheff procedure for multiple objective programming
inferredcites →https://doi.org/10.1016/0022-247x(87)90264-2openalex-snapshot
Connectedness of the efficient point sets in quasiconcave vector maximization
inferredcites →https://doi.org/10.1016/0305-0548(80)90016-7openalex-snapshot
An interactive algorithm for multicriteria programming
inferredcites →https://doi.org/10.1111/j.1540-5915.1979.tb00004.xopenalex-snapshot
MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS*
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/0-306-48107-3_2openalex-snapshot
Nonlinear Multiobjective 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-642-46854-4_37openalex-snapshot
Location of a Semiobnoxious Facility. A Biobjective Approach
inferred← citeshttps://doi.org/10.1007/bf02568513openalex-snapshot
Utility efficiency and its approximation
inferred← citeshttps://doi.org/10.1007/s10013-015-0144-0openalex-snapshot
The Adaptive Parameter Control Method and Linear Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10589-011-9403-5openalex-snapshot
Generating equidistant representations in biobjective programming
inferred← citeshttps://doi.org/10.1007/s10957-005-5494-4openalex-snapshot
Approximation Methods in Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/s10957-013-0294-8openalex-snapshot
The Pascoletti–Serafini Scalarization Scheme and Linear Vector Optimization
inferred← citeshttps://doi.org/10.1007/s11081-009-9099-xopenalex-snapshot
On the quality of discrete representations in multiple objective programming
inferred← citeshttps://doi.org/10.1023/a:1008270131268openalex-snapshot
Efficiency and Solution Approaches to Bicriteria Nonconvex Programs
inferred← citeshttps://doi.org/10.1023/a:1008751400773openalex-snapshot
Computational Study of the Relationships Between Feasible and Efficient Sets and an Approximation
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.1109/tevc.2007.892759openalex-snapshot
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
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.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.