An incentive dynamic programming method for the optimization of scholarship assignment

DOI10.1155/2018/5206131zbMath1417.90148OpenAlexW2885878106MaRDI QIDQ1727142

Zhiyuan Liu, Yu Gu, Di Huang, Jun Chen, Hans Wang

Publication date: 20 February 2019

Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/5206131

Mathematics Subject Classification ID

Dynamic programming (90C39) Discrete location and assignment (90B80)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• The scholarship assignment problem
• Dynamic programming algorithms for the zero-one knapsack problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• The knapsack problem: A survey
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms

This page was built for publication: An incentive dynamic programming method for the optimization of scholarship assignment