Pages that link to "Item:Q3576204"
From MaRDI portal
The following pages link to Approximability and Hardness in Multi-objective Optimization (Q3576204):
Displaying 14 items.
- Multi-criteria TSP: Min and Max combined (Q433836) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem (Q785628) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- A general approximation method for bicriteria minimization problems (Q2402670) (← links)
- (Q2999211) (← links)
- Deterministic Algorithms for Multi-criteria TSP (Q3010407) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- (Q3197630) (← links)
- Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems (Q3621927) (← links)
- (Q4514764) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← 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)