Some remarks about usage of list management techniques for algorithms to solving time-transportation problems
Abstract
Not available.Downloads
References
R. Avram-Nitchi, Parametric and linear programming with adding conditions. These, Univ. "Babeş-Bolyai", 1990.
-, Asupra unei probleme de transport cu criteriu de timp şi cu condiţii suplimentare. Culegere de studii şi cerc. econ. Univ. "Babeş-Bolyai" Cluj-Napoca, XIV (1984), pp. 321-331.
-, About list management algorithm for solving the transportation problem. Itinerant seminar on funct. eq., approximation and convexity, Univ. "Babeş-Bolyai", Cluj-Napoca, Preprint 7(1986), pp. 25-32.
-, Some remarks about using list management in transportaiton problem. ibi., 6 (1987), pp. 79-85.
W. Grabowski, the problem of transportaiton in minimal time. Bull. Acad. Pol. Sci., 12 (1964), 1 , pp. 357-390.
P. L. Hammer, Time minimization transportaiton problem., Nrlq, 16 (1971), pp. 487-491, https://doi.org/10.1002/nav.3800180406
A. Janicki, Remarks on the time transportation problem. Zastasowania Math., 11 (1970), pp. 493-502, https://doi.org/10.4064/am-11-4-493-502
V. Srinivasan and G. L. Thompson, Accelerated algorithm for lebeling and relabeling of treees, J. of ACM, 19 (1972), 9, pp. 712-726, https://doi.org/10.1145/321724.321734
-, Benefit - cost analysis of coding technique for the primal transportaiton algorithm. ibi., 20 (1973), 2, pp. 194-213, https://doi.org/10.1145/321752.321754
W. Sywarc, The time transportation problem, Yastastowania Math., 8 (1966), pp. 231-239.
-, Some remarks on the time-transportation problem. NRLQ 18 (1971), 4, pp. 473-485,https://doi.org/10.1002/nav.3800180405
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Journal of Numerical Analysis and Approximation Theory
This work is licensed under a Creative Commons Attribution 4.0 International License.
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.