Interval estimation of a global optimum for large combinatorial problems
- 1 March 1979
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 26 (1) , 69-77
- https://doi.org/10.1002/nav.3800260108
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Point estimation of a global optimum for large combinatorial problemsCommunications in Statistics - Simulation and Computation, 1978
- A statistical approach to the tspNetworks, 1977
- Procedures for Estimating Optimal Solution Values for Large Combinatorial ProblemsManagement Science, 1977
- A man-machine approach toward solving the traveling salesman problemCommunications of the ACM, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Maximum-Likelihood Estimation of the Parameters of Gamma and Weibull Populations from Complete and from Censored SamplesTechnometrics, 1965
- Estimation of a truncation pointBiometrika, 1964
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- Limiting forms of the frequency distribution of the largest or smallest member of a sampleMathematical Proceedings of the Cambridge Philosophical Society, 1928