On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem

DOI10.1287/MOOR.1030.0076MaRDI QIDQ5704180zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

resource allocation, discrete optimization, combinatorial optimization, concave function

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• Near-Optimal Solution of Generalized Resource Allocation Problems with Large Capacities
• A polynomial algorithm for resourse allocation problems with polymatroid constrains¹
• scientific article; zbMATH DE number 2086936
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• An improved approximation algorithm for \textsc{Resource Allocation}

Cited in

(8)

• Complexity and algorithms for nonlinear optimization problems
• Algorithms for separable convex optimization with linear ascending constraints
• Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.
• A decomposition algorithm for nested resource allocation problems
• On solving convex optimization problems with linear ascending constraints
• Minimum entropy orientations
• Finding the modes of some multivariate discrete probability distributions: application of the resource allocation problem
• On a Reduction for a Class of Resource Allocation Problems

This page was built for publication: On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704180)