K-Sum Linear Programming

DOI10.1057/jors.1992.51zbMath0756.90062OpenAlexW2070748374MaRDI QIDQ4018526

Abraham P. Punnen

Publication date: 16 January 1993

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1992.51

zbMATH Keywords

polynomial algorithms\(k\)-sum linear programmingsimplex-based algorithms

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (5)

Computing conforming partitions of orthogonal polygons with minimum stabbing number ⋮ Revisiting \(k\)-sum optimization ⋮ Bridging \(k\)-sum and CVaR optimization in MILP ⋮ New algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation ⋮ The partial sum criterion for Steiner trees in graphs and shortest paths

This page was built for publication: K-Sum Linear Programming