|
|||||
|
|
A branching method for the fixed charge transportation problem |
|
| Authors: | Veena Adlakha Krzysztof Kowalski Benjamin Lev |
| Institution: | 1. Merrick School of Business, University of Baltimore, 1420 North Charles Street, Baltimore, MD 21201, USA;2. Department of Transportation, State of Connecticut, 121 Cimarron Road, Middletown, CT 06457, USA;3. LeBow College of Business, Drexel University, Philadelphia, PA 19104, USA |
| Abstract: | This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed method. |
| Keywords: | Transportation Fixed charge Iterative method |
| 本文献已被 ScienceDirect 等数据库收录！ | |