The following pages link to (Q4514764):
Displaying 7 items.
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- On the cardinality of the nondominated set of multi-objective combinatorial optimization problems (Q1949687) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models (Q4632846) (← links)
- Approximating multiobjective optimization problems: how exact can you be? (Q6616269) (← links)