Pages that link to "Item:Q2402670"
From MaRDI portal
The following pages link to A general approximation method for bicriteria minimization problems (Q2402670):
Displaying 12 items.
- Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
- Reference point approximation method for the solution of bicriterial nonlinear optimization problems (Q1321206) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- On Multivariate Discrete Moment Problems: Generalization of the Bivariate Min Algorithm for Higher Dimensions (Q3648530) (← links)
- An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems (Q5055294) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Approximations of bi-criteria optimization problem (Q5232010) (← links)
- Norm-based approximation in bicriteria programming (Q5946767) (← links)
- Efficiency and approachability of nonconvex bicriteria programs (Q5946936) (← links)
- Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory (Q6616270) (← links)