A faster algorithm for the resource allocation problem with convex cost functions

We revisit the classical resource allocation problem with general convex objective functions, subject to an integer knapsack constraint. This class of problems is fundamental in discrete optimization and arises in a wide variety of applications. In this paper, we propose a novel polynomial-time divi...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 34; s. 137 - 146
Hlavní autori:	Shi, Cong, Zhang, Huanan, Qin, Chao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.09.2015
Predmet:	Complexity analysis Data structure Nonlinear combinatorial optimization Polynomial-time algorithms Polynomial-time algorithms Complexity analysis Nonlinear combinatorial optimization Data structure
ISSN:	1570-8667, 1570-8675
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!