Pages that link to "Item:Q532529"
From MaRDI portal
The following pages link to Constructing a Pareto front approximation for decision making (Q532529):
Displaying 24 items.
- Global search perspectives for multiobjective optimization (Q377750) (← links)
- Two-sided Pareto front approximations (Q463001) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
- Comparison of two Pareto frontier approximations (Q889160) (← links)
- On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach (Q905750) (← links)
- On upper approximations of Pareto fronts (Q1630272) (← links)
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach (Q1655397) (← links)
- Interactive \textsc{Nonconvex Pareto Navigator} for multiobjective optimization (Q1711468) (← links)
- Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
- On the estimation of Pareto fronts from the point of view of copula theory (Q1750061) (← links)
- Non-convex Pareto set navigation (Q2086343) (← links)
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization (Q2349520) (← links)
- A new algorithm using front prediction and NSGA-II for solving two and three-objective optimization problems (Q2357947) (← links)
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making (Q2397433) (← links)
- Response surface approximation of Pareto optimal front in multi-objective optimization (Q2459284) (← links)
- Construction of Pareto set in a system of conceptual uncertainty problems (Q2771572) (← links)
- A simple method for approximating a general Pareto surface (Q3005831) (← links)
- Clustering aided approach for decision making in computationally expensive multiobjective optimization (Q3620909) (← links)
- (Q3762061) (← links)
- A computationally efficient algorithm to approximate the pareto front of multi-objective linear fractional programming problem (Q5244299) (← links)
- Multiple-gradient Descent Algorithm for Pareto-Front Identification (Q5259697) (← links)
- Prediction of Pareto dominance using nearest neighbor method based on decision space transformation (Q5367561) (← links)
- Sustainable supply chain network design: a study of the Colombian dairy sector (Q6115608) (← links)