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

Keyphrases

• Fast Algorithm 100%
• Resource Allocation Problem 100%
• Convex Cost Function 100%
• Polynomial Time 50%
• Computational Complexity 50%
• Polynomial-time Algorithm 50%
• Discrete Optimization 50%
• Convex Objective Function 50%
• Integer Knapsack 50%
• Knapsack Constraint 50%
• Multi-phase Algorithms 50%

Computer Science

• Allocation Problem 100%
• Fast Algorithm 100%
• Resource Allocation 100%
• Objective Function 50%
• Polynomial Time 50%
• Computational Complexity 50%
• polynomial-time algorithm 50%
• Discrete Optimization 50%
• Knapsack 50%
• Phase Algorithm 50%
• Divide-and-Conquer Algorithm 50%

Mathematics

• Polynomial Time 100%
• Cost Function 100%
• Fast Algorithm 100%
• Convex 100%
• Objective Function 50%
• Integer 50%
• Wide Variety 50%
• Divide and Conquer 50%