On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem
From MaRDI portal
Publication:5704180
DOI10.1287/moor.1030.0076zbMath1082.90099OpenAlexW2115815938MaRDI QIDQ5704180
Satoko Moriguchi, Akiyoshi Shioura
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1030.0076
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Algorithms for separable convex optimization with linear ascending constraints ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem. ⋮ Complexity and algorithms for nonlinear optimization problems ⋮ Finding the modes of some multivariate discrete probability distributions: application of the resource allocation problem ⋮ Minimum entropy orientations ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ On solving convex optimization problems with linear ascending constraints