Pages that link to "Item:Q5084597"
From MaRDI portal
The following pages link to Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597):
Displaying 12 items.
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization (Q2678998) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines (Q2691455) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- Approximating biobjective minimization problems using general ordering cones (Q6162511) (← links)
- Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)
- An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)
- Approximating multiobjective optimization problems: how exact can you be? (Q6616269) (← links)
- Using scalarizations for the approximation of multiobjective optimization problems: towards a general theory (Q6616270) (← links)
- A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem (Q6663968) (← links)
