ISSN:
1572-9338
Schlagwort(e):
Linear networks
;
algorithms
;
computational methods
;
primal-dual algorithm
;
C
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
,
Wirtschaftswissenschaften
Notizen:
Abstract In this paper, an algorithm is presented for the transshipment problem that is an adaption of the method used by Jones, Saigal, and Schneider for solving single-commodity, spatial-equilibrium problems. The approach uses a variable-dimension strategy in which a sequence of subproblems is formed by solving the problem ‘one-node-at-a-time’. The algorithm is tested on uncapacitated transportation problems. Although the computational results are not directly comparable to other methods (since the algorithm is implemented in C under UNIX), the results show that the method is very effective and may e competitive with the best available algorithms for linear network problems.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF02022085
Permalink