The following pages link to On \(k\)-Max-optimization (Q1002079):
Displaying 12 items.
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- On \(k\)-sum optimization (Q1919195) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- A note on the asymptotic behaviour of bottleneck problems (Q2488222) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
