A faster algorithm for the resource allocation problem with convex cost functions
From MaRDI portal
Publication:491166
DOI10.1016/j.jda.2015.06.001zbMath1337.91048OpenAlexW762829923MaRDI QIDQ491166
Cong Shi, Chao Qin, Huanan Zhang
Publication date: 24 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2015.06.001
Analysis of algorithms and problem complexity (68Q25) Nonlinear programming (90C30) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (1)
Cites Work
- Unnamed Item
- The art and theory of dynamic programming
- Optimal resource allocation in survey designs
- A survey on the continuous nonlinear resource allocation problem
- A review of the joint replenishment problem literature: 1989--2005
- Complexity and algorithms for nonlinear optimization problems
- Sequential Production Planning Over Time at Minimum Cost
- On a Class of Minimum-Cost Problems
- Optimal allocation and control problems for software-testing resources
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Mass Screening Models for Contagious Diseases with No Latent Period
- Simple Ranking Methods for Allocation of One Resource
- An Algorithm for Solving a Resource Allocation Problem
- `` Strong NP-Completeness Results
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
- The Status of Mathematical Inventory Theory
- Discrete Optimization Via Marginal Analysis
- Technical Note—Comment on an Integer Maximization Problem
This page was built for publication: A faster algorithm for the resource allocation problem with convex cost functions
