Combinatorial programming, statistical optimization and the optimal transportation network problem
- 1 April 1982
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 16 (2) , 89-124
- https://doi.org/10.1016/0191-2615(82)90030-3
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Interval estimation of a global optimum for large combinatorial problemsNaval Research Logistics Quarterly, 1979
- Exact and approximate algorithms for optimal network designNetworks, 1979
- Simultaneous optimization of land use and transportation: A synthesis of the quadratic assignment problem and the optimal network problemRegional Science and Urban Economics, 1978
- A Survey of Analysis Techniques for Discrete AlgorithmsACM Computing Surveys, 1977
- A statistical approach to the tspNetworks, 1977
- Transport network optimization in the Dutch integral transportation studyTransportation Research, 1974
- Optimal Network Problem: A Branch-and-Bound AlgorithmEnvironment and Planning A: Economy and Space, 1973
- Estimation of a truncation pointBiometrika, 1964
- A Method for Finding the Shortest Route Through a Road NetworkJournal of the Operational Research Society, 1960
- Numerical Tabulation of the Distribution of Kolmogorov's Statistic for Finite Sample SizeJournal of the American Statistical Association, 1952