Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner [17] and Weingartner and Ness [19] by including multilevel ...
Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming
This paper considers a minimum-cost network flow problem in a bipartite graph with a single sink. The transportation costs exhibit a staircase cost structure because such types of transportation cost ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results