Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hammersley, J. M.
1960.
MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS.
Annals of the New York Academy of Sciences,
Vol. 86,
Issue. 3,
p.
844.
Hammersley, J. M.
1961.
On Steiner's network problem.
Mathematika,
Vol. 8,
Issue. 2,
p.
131.
Frisch, H. L.
and
Hammersley, J. M.
1963.
Percolation Processes and Related Topics.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 11,
Issue. 4,
p.
894.
Hammersley, J. M.
and
Handscomb, D. C.
1964.
Monte Carlo Methods.
p.
43.
Gilbert, E. N.
1965.
Random Minimal Trees.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 13,
Issue. 2,
p.
376.
Halton, John H.
1970.
A Retrospective and Prospective Survey of the Monte Carlo Method.
SIAM Review,
Vol. 12,
Issue. 1,
p.
1.
Golden, B. L.
1977.
A statistical approach to the tsp.
Networks,
Vol. 7,
Issue. 3,
p.
209.
Papadimitriou, C. H.
1978.
The complexity of the capacitated tree problem.
Networks,
Vol. 8,
Issue. 3,
p.
217.
Golden, Bruce L.
and
Alt, Frank B.
1979.
Interval estimation of a global optimum for large combinatorial problems.
Naval Research Logistics Quarterly,
Vol. 26,
Issue. 1,
p.
69.
Weide, Bruce W.
1980.
Random Graphs and Graph Optimization Problems.
SIAM Journal on Computing,
Vol. 9,
Issue. 3,
p.
552.
Steele, J. Michael
1980.
Shortest paths through pseudorandom points in the 𝑑-cube.
Proceedings of the American Mathematical Society,
Vol. 80,
Issue. 1,
p.
130.
Papadimitriou, Christos H.
1981.
Worst-Case and Probabilistic Analysis of a Geometric Location Problem.
SIAM Journal on Computing,
Vol. 10,
Issue. 3,
p.
542.
Leont'ev, V. K.
1981.
Discrete extremal problems.
Journal of Soviet Mathematics,
Vol. 15,
Issue. 2,
p.
101.
Lueker, George S.
1981.
Optimization Problems on Graphs with Independent Random Edge Weights.
SIAM Journal on Computing,
Vol. 10,
Issue. 2,
p.
338.
Kirkpatrick, Scott
1981.
Disordered Systems and Localization.
Vol. 149,
Issue. ,
p.
280.
Magnanti, T. L.
1981.
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects.
Networks,
Vol. 11,
Issue. 2,
p.
179.
Hochbaum, Dorit
and
Steele, J. Michael
1982.
Steinhaus's geometric location problem for random samples in the plane.
Advances in Applied Probability,
Vol. 14,
Issue. 1,
p.
56.
Halton, J. H.
and
Terada, R.
1982.
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One.
SIAM Journal on Computing,
Vol. 11,
Issue. 1,
p.
28.
Dempster, M. A. H.
1982.
Deterministic and Stochastic Scheduling.
p.
271.
Hochbaum, Dorit
and
Steele, J. Michael
1982.
Steinhaus's geometric location problem for random samples in the plane.
Advances in Applied Probability,
Vol. 14,
Issue. 1,
p.
56.