On \(k\)-sum optimization

DOI10.1016/0167-6377(95)00059-3zbMath0855.90109OpenAlexW2037188497MaRDI QIDQ1919195

Abraham P. Punnen, Yash P. Aneja

Publication date: 1 August 1996

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00059-3

zbMATH Keywords

polynomial time\(\varepsilon\)-approximation\(k\)-sum optimizationbottleneck and minsum problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (11)

Minimum dispersion problems ⋮ Revisiting \(k\)-sum optimization ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms ⋮ Quadratic bottleneck problems ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ On \(k\)-Max-optimization ⋮ The partial sum criterion for Steiner trees in graphs and shortest paths ⋮ \((r,p)\)-centroid problems on paths and trees ⋮ The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

Cites Work

• Unnamed Item
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• k-sum optimization problems
• On minimizing the sum of \(k\) tardinesses
• Properties of thek-centra in a tree network
• Centers to centroids in graphs
• Thek-nucleus of a graph
• Bottleneck extrema

This page was built for publication: On \(k\)-sum optimization