The Vector Partition Problem for Convex Objective Functions
From MaRDI portal
Publication:2757683
DOI10.1287/moor.26.3.583.10587zbMath1073.90535OpenAlexW2095866597MaRDI QIDQ2757683
Leonard J. Schulman, Shmuel Onn
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1920e6c133a90802833b3e68094c27cebd07e2ff
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Partitions of sets (05A18) Combinatorial optimization (90C27) Convex functions and convex programs in convex geometry (52A41)
Related Items (17)
The complexity of vector partition ⋮ On the Complexity of the Minimum Independent Set Partition Problem ⋮ Screening multi‐dimensional heterogeneous populations for infectious diseases under scarce testing resources, with application to <scp>COVID</scp>‐19 ⋮ An LP-based \(k\)-means algorithm for balancing weighted point sets ⋮ The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. ⋮ An exact algorithm for finding a vector subset with the longest sum ⋮ Nonlinear bipartite matching ⋮ New bounds on the unconstrained quadratic integer programming problem ⋮ On the number of separable partitions ⋮ The use of edge-directions and linear programming to enumerate vertices ⋮ Sphere-separable partitions of multi-parameter elements ⋮ On the gap between the quadratic integer programming problem and its semidefinite relaxation ⋮ Complexity and algorithms for finding a subset of vectors with the longest sum ⋮ Convex integer maximization via Graver bases ⋮ Approximability of the Problem of Finding a Vector Subset with the Longest Sum ⋮ Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm ⋮ Graphs of transportation polytopes
This page was built for publication: The Vector Partition Problem for Convex Objective Functions
