https://doi.org/10.2307/2581283 • https://www.jstor.org/stable/2581283 Copy URL A preference order dynamic programming model proposed in the literature for solving ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback