A branching method for the fixed charge transportation problem
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.
Year of publication: |
2010
|
---|---|
Authors: | Adlakha, Veena ; Kowalski, Krzysztof ; Lev, Benjamin |
Published in: |
Omega. - Elsevier, ISSN 0305-0483. - Vol. 38.2010, 5, p. 393-397
|
Publisher: |
Elsevier |
Subject: | Transportation Fixed charge Iterative method |
Saved in:
Saved in favorites
Similar items by person
-
On approximation of the fixed charge transportation problem
Adlakha, Veena, (2014)
-
More-for-less algorithm for fixed-charge transportation problems
Adlakha, Veena, (2007)
-
More-for-less algorithm for fixed-charge transportation problems
Adlakha, Veena, (2007)
- More ...