JOURNAL ARTICLE

A hybrid dynamic programming method for concave resource allocation problems

Ji-rong JiangXiao-ling Sun

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
© 2026 ScienceGate Book Chapters — All rights reserved.