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 ...
This is a preview. Log in through your library . Abstract This paper describes a dynamic programming model that has been developed to determine an optimal expansion plan for the generating capacity of ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results