JOURNAL ARTICLE
A hybrid dynamic programming method for concave resource allocation problems
Year: 2005 Journal: Journal of Shanghai University (English Edition) Vol: 9 (2)Pages: 95-98 Publisher: Springer Nature
Keywords:
Mathematical optimization Concave function Knapsack problem Integer programming Bounded function Mathematics Domain (mathematical analysis) Monotonic function Regular polygon Resource allocation Linear programming Function (biology) Effective domain Convergence (economics) Partition (number theory) Computer science Convex optimization Convex analysis Combinatorics
Metrics
1
Cited By
0.27
FWCI (Field Weighted Citation Impact)
8
Refs
0.62
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Optimization and Search Problems
Physical Sciences → Computer Science → Computer Networks and Communications
Vehicle Routing Optimization Methods
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Optimization and Packing Problems
Physical Sciences → Engineering → Industrial and Manufacturing Engineering
Related Documents
JOURNAL ARTICLE
Approximate dynamic programming for stochastic resource allocation problems
Ali ForootaniRaffaele IervolinoMassimo TipaldiJoshua Neilson
Journal: IEEE/CAA Journal of Automatica Sinica Year: 2020 Vol: 7 (4)Pages: 975-990
JOURNAL ARTICLE
Resource Allocation Problems with Concave Reward Functions
S. GrundelPeter BormHerbert Hamers
Journal: SSRN Electronic Journal Year: 2013
BOOK-CHAPTER
Approximate Dynamic Programming for High-Dimensional Resource Allocation Problems
Year: 2009
BOOK-CHAPTER
Approximate Dynamic Programming for Large-Scale Resource Allocation Problems
Warren B. PowellHüseyin Topaloğlu
Year: 2006 Pages: 123-147
JOURNAL ARTICLE
Resource allocation problems with concave reward functions
S. GrundelPeter BormHerbert Hamers
Journal: Top Year: 2018 Vol: 27 (1)Pages: 37-54