A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function

DOI10.2307/3009712zbMath0407.90062OpenAlexW4240125563MaRDI QIDQ4194738

Naoki Katoh, Hisashi Mine, Toshihide Ibaraki

Publication date: 1979

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

Full work available at URL: https://doi.org/10.2307/3009712

zbMATH Keywords

Computational ComplexityInteger ProgrammingNp-Complete ProblemsResource Allocation ProblemIncremental MethodLagrangian Multiples

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, A survey on the continuous nonlinear resource allocation problem, A faster algorithm for the resource allocation problem with convex cost functions, On the continuous quadratic knapsack problem, An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint, Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments, Fair resource allocation for demands with sharp lower tail inequalities, Inverse optimization for linearly constrained convex separable programming problems, An efficient algorithm for the parametric resource allocation problem