| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5128360 | Operations Research Letters | 2017 | 4 Pages |
Abstract
Consider the ordinary transportation problem with the objective to minimize the cost of transporting a single commodity from M warehouses to N demand locations. Each warehouse i has a finite capacity ki. We convert the above problem into a dual problem and construct a greedy algorithm to solve it.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fang Liu,