The following pages link to k-sum optimization problems (Q916568):
Displaying 15 items.
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- Minimum deviation problems (Q1104246) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Bridging \(k\)-sum and CVaR optimization in MILP (Q1722975) (← links)
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases (Q1755782) (← links)
- On \(k\)-sum optimization (Q1919195) (← links)
- On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
- On line sum optimization (Q2228118) (← links)
- Objective functions with redundant domains (Q2392743) (← links)
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation (Q2664297) (← links)
- A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
- A Linear optimization problem related to kronecker sums (Q4531543) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
