Direct versus terminal freight routing on a network with concave costs
- 31 August 1987
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 21 (4) , 287-298
- https://doi.org/10.1016/0191-2615(87)90028-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient approach to solving the road network equilibrium traffic assignment problemPublished by Elsevier ,2002
- Network Design and Transportation Planning: Models and AlgorithmsTransportation Science, 1984
- A New Optimization Method for Large Scale Fixed Charge Transportation ProblemsOperations Research, 1981
- Adjacent extreme flows and application to min concave cost flow problemsNetworks, 1979
- A Survey of Linear Cost Multicommodity Network FlowsOperations Research, 1978
- Using shortest paths in some transshipment problems with concave costsMathematical Programming, 1977
- Multicommodity Distribution System Design by Benders DecompositionManagement Science, 1974
- Minimum cost routing for static network modelsNetworks, 1971
- Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1969
- Minimum Concave Cost Flows in Certain NetworksManagement Science, 1968