The Factored Transportation Problem
The factored transportation problem is one having cost coefficients of the form c ij = u i v j . The main result proven in this paper is that if rows are arranged according to nonincreasing u i and columns by nondecreasing v j , then the northwest corner rule provides an optimal solution. Applications to stock location in a warehouse and information storage and retrieval policies are presented. For the stock location problem, this verifies that a previously advocated heuristic is optimal.
Volume (Year): 30 (1984)
Issue (Month): 8 (August)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:8:p:1021-1024. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.