Pages that link to "Item:Q513168"
From MaRDI portal
The following pages link to Covers and approximations in multiobjective optimization (Q513168):
Displaying 13 items.
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- Method of non-uniform coverages to solve the multicriteria optimization problems with guaranteed accuracy (Q891206) (← links)
- On upper approximations of Pareto fronts (Q1630272) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
- An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy (Q2840251) (← links)
- Computing Convex Coverage Sets for Faster Multi-objective Coordination (Q5246704) (← links)
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets (Q5745164) (← links)
- Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)
- An introduction to multiobjective simulation optimization (Q6600049) (← links)
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory (Q6616270) (← links)