| Article ID: | iaor19971527 |
| Country: | India |
| Volume: | 33 |
| Issue: | 3 |
| Start Page Number: | 145 |
| End Page Number: | 161 |
| Publication Date: | Sep 1996 |
| Journal: | OPSEARCH |
| Authors: | Verma Vanita, Puri M.C. |
| Keywords: | textbooks: general, programming: transportation, transportation: general |
This paper develops an efficient branch and bound procedure to solve a class of transportation problems, where total cost of transporting a homogeneous product from a given set of sources to a known set of uses is to be minimized under the conditions that each source supplies to at least one user and a user receives its demand from a unique source.