On the public citation graph

On the characterization of Pareto-optimal solutions in bicriterion optimization

0 signed · 44 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/978-1-4615-8768-2_2openalex-snapshot
Nondominated Decisions and Cone Convexity in Dynamic Multicriteria Decision Problems
inferredcites →https://doi.org/10.1007/978-1-4615-8768-2_4openalex-snapshot
Compromise Solutions, Domination Structures, and Salukvadze’s Solution
inferredcites →https://doi.org/10.1007/978-3-642-45486-8openalex-snapshot
Multiple Criteria Decision Making Kyoto 1975
inferredcites →https://doi.org/10.1007/978-3-642-45486-8_12openalex-snapshot
On the Approximation of Solutions to Multiple Criteria Decision Making Problems
inferredcites →https://doi.org/10.1007/bf00926600openalex-snapshot
Differential games, dynamic optimization, and generalized control theory
inferredcites →https://doi.org/10.1007/bf00932299openalex-snapshot
Some problems of scalar and vector-valued optimization in linear viscoelasticity
inferredcites →https://doi.org/10.1007/bf00932518openalex-snapshot
On convex vectorial optimization in linear spaces
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/bf00932662openalex-snapshot
A note on functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf00932849openalex-snapshot
Nondominated decisions and cone convexity in dynamic multicriteria decision problems
inferredcites →https://doi.org/10.1007/bf00933046openalex-snapshot
Parametric solution to the joint system identification and optimization problem
inferredcites →https://doi.org/10.1007/bf00933094openalex-snapshot
Proper inequality constraints and maximization of index vectors
inferredcites →https://doi.org/10.1007/bf00933455openalex-snapshot
On convex vectorial optimization in linear spaces
inferredcites →https://doi.org/10.1007/bf00933589openalex-snapshot
On noninferior performance index vectors
inferredcites →https://doi.org/10.1007/bf00934871openalex-snapshot
Compromise solutions, domination structures, and Salukvadze's solution
inferredcites →https://doi.org/10.1007/bf01262931openalex-snapshot
On functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf01767453openalex-snapshot
Proper equality constraints and maximization of index vectors
inferredcites →https://doi.org/10.1016/0005-1098(72)90052-0openalex-snapshot
A computational approach to the combined problem of optimization and parameter identification
inferredcites →https://doi.org/10.1016/0012-8252(76)90034-9openalex-snapshot
Multiobjective optimization in water resources systems
inferredcites →https://doi.org/10.1016/0021-9045(74)90095-1openalex-snapshot
On vectorial approximation
inferredcites →https://doi.org/10.1109/tac.1975.1101018openalex-snapshot
An algorithm for bicriteria optimization based on the sensitivity function
inferredcites →https://doi.org/10.1109/tac.9openalex-snapshot
IEEE Transactions on Automatic Control
inferredcites →https://doi.org/10.1109/tsmc.1971.4308298openalex-snapshot
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
inferredcites →https://doi.org/10.1137/0132004openalex-snapshot
The Vector Maximization Problem: Proper Efficiency and Stability
inferredcites →https://doi.org/10.1287/mnsc.19.8.936openalex-snapshot
A Class of Solutions for Group Decision Problems
inferredcites →https://doi.org/10.1287/opre.15.1.39openalex-snapshot
Solving Bicriterion Mathematical Programs
inferredcites →https://doi.org/10.3390/books978-3-0365-2816-8openalex-snapshot
Multiple-Criteria Decision Making

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1099-1360(199609)5:3<232::aid-mcda103>3.0.co;2-7openalex-snapshot
On the Structure of the Non-dominated Set for Bicriteria Programmes
inferred← citeshttps://doi.org/10.1002/1520-6750(199012)37:6<937::aid-nav3220370612>3.0.co;2-4openalex-snapshot
Analysis of a bicriteria location model
inferred← citeshttps://doi.org/10.1002/nav.3800290307openalex-snapshot
Interactive solution of bi-criteria mathematical programs
inferred← citeshttps://doi.org/10.1007/978-3-642-46473-7_38openalex-snapshot
Efficiency and Solution Approaches to Bi-Objective Mathematical Programs
inferred← citeshttps://doi.org/10.1007/bf00939823openalex-snapshot
A survey of vector optimization in infinite-dimensional spaces, part 2
inferred← citeshttps://doi.org/10.1007/bf02192023openalex-snapshot
Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
inferred← citeshttps://doi.org/10.1007/s11238-005-3219-7openalex-snapshot
Convexity and Differentiability of Controlled Risk
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80015-5openalex-snapshot
Optimization for design problems having more than one objective
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90091-1openalex-snapshot
An algorithm for bicriterion linear programming
inferred← citeshttps://doi.org/10.1016/0377-2217(88)90458-4openalex-snapshot
A graphical bicriteria approach to the resource allocation problem
inferred← citeshttps://doi.org/10.1021/ie010288gopenalex-snapshot
Multiobjective Optimization of Cyclic Adsorption Processes
inferred← citeshttps://doi.org/10.1023/a:1004657827134openalex-snapshot
Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem
inferred← citeshttps://doi.org/10.1023/a:1008270131268openalex-snapshot
Efficiency and Solution Approaches to Bicriteria Nonconvex Programs
inferred← citeshttps://doi.org/10.1057/jors.1994.212openalex-snapshot
Bicriterion Programs and Managerial Location Decisions: Application to the Banking Sector
inferred← citeshttps://doi.org/10.1080/02331938208842824openalex-snapshot
Bibliographic zur Vektoroptimierung -Theorie und Anwendungen (1. Fortsetzung)
inferred← citeshttps://doi.org/10.22034/2015.2.07openalex-snapshot
Multiple Criteria Decision Making Combined with VRP: A Categorized Bibliographic Study
inferred← citeshttps://doi.org/10.4236/ajor.2018.85019openalex-snapshot
Fast Computation of Pareto Set for Bicriteria Linear Programs with Application to a Diet Formulation Problem
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.