Pages that link to "Item:Q2141729"
From MaRDI portal
The following pages link to An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729):
Displaying 11 items.
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions (Q513166) (← links)
- A path following method for box-constrained multiobjective optimization with applications to goal programming problems (Q1423708) (← links)
- Approximating nondominated sets in continuous multiobjective optimization problems (Q5318290) (← links)
- (Q6039732) (← links)
- Advancements in the computation of enclosures for multi-objective optimization problems (Q6113330) (← links)
- Adaptive sampling stochastic multigradient algorithm for stochastic multiobjective optimization (Q6142067) (← links)
- Adaptive piecewise linear relaxations for enclosure computations for nonconvex multiobjective mixed-integer quadratically constrained programs (Q6166099) (← links)
- A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems (Q6616279) (← links)
- Deep learning the efficient frontier of convex vector optimization problems (Q6618150) (← links)
- On necessary optimality conditions for sets of points in multiobjective optimization (Q6636780) (← links)
- A solver for multiobjective mixed-integer convex and nonconvex optimization (Q6644257) (← links)
