A faster algorithm for the resource allocation problem with convex cost functions
type: Item
instance of: scholarly article
title: A faster algorithm for the resource allocation problem with convex cost functions
zbMATH Open document ID: 1337.91048
author: Cong Shi
author: Huanan Zhang
author: Chao Qin
published in: Journal of Discrete Algorithms
publication date: 2015-08-24T00:00:00Z
Mathematics Subject Classification ID: 91B32
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6475115
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: complexity analysis
zbMATH Keywords: data structure
zbMATH Keywords: nonlinear combinatorial optimization
MaRDI profile type: Publication
full work available at URL: j.jda.2015.06.001
OpenAlex ID: W762829923
cites work: Optimal resource allocation in survey designs
cites work: Q3651735
cites work: The art and theory of dynamic programming
cites work: An Algorithm for Solving a Resource Allocation Problem
cites work: The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
cites work: Discrete Optimization Via Marginal Analysis
cites work: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort
cites work: `` Strong '' NP-Completeness Results
cites work: Complexity and algorithms for nonlinear optimization problems
cites work: Sequential production planning over time at minimum cost
cites work: On a class of minimum-cost problems
cites work: A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
cites work: A review of the joint replenishment problem literature: 1989--2005
cites work: Mass Screening Models for Contagious Diseases with No Latent Period
cites work: Optimal allocation and control problems for software-testing resources
cites work: A survey on the continuous nonlinear resource allocation problem
cites work: The Status of Mathematical Inventory Theory
cites work: Technical Note—Comment on an Integer Maximization Problem
cites work: Simple Ranking Methods for Allocation of One Resource
DOI: 10.1016/J.JDA.2015.06.001
description: scientific article; zbMATH DE number 6475115