k-sum optimization problems

DOI10.1016/0167-6377(90)90051-6zbMath0703.90072OpenAlexW2012865538MaRDI QIDQ916568

S. K. Gupta, Abraham P. Punnen

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0167-6377(90)90051-6

zbMATH Keywords

k-sum optimizationk-sum spanning tree

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

The quadratic minimum spanning tree problem and its variations ⋮ On \(k\)-sum optimization ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ Revisiting \(k\)-sum optimization ⋮ A kernel search heuristic for a fair facility location problem ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ Quadratic bottleneck problems ⋮ On the generality of the greedy algorithm for solving matroid base problems ⋮ The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases ⋮ On single-source capacitated facility location with cost and fairness objectives ⋮ The partial sum criterion for Steiner trees in graphs and shortest paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced optimization problems
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• Minimum deviation problems
• The Min-Max Spanning Tree Problem and some extensions
• Properties of thek-centra in a tree network
• Centers to centroids in graphs

This page was built for publication: k-sum optimization problems