Randomized algorithms in combinatorial optimization: A survey
- 30 June 1986
- journal article
- review article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 14 (2) , 157-170
- https://doi.org/10.1016/0166-218x(86)90058-2
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Some experience in applying a stochastic method to location problemsPublished by Springer Nature ,1986
- Unlabelled Partition Systems: Optimization and ComplexitySIAM Journal on Algebraic Discrete Methods, 1984
- A thermodynamically motivated simulation procedure for combinatorial optimization problemsEuropean Journal of Operational Research, 1984
- Optimization by Simulated AnnealingScience, 1983
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Interval estimation of a global optimum for large combinatorial problemsNaval Research Logistics Quarterly, 1979
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977
- A statistical approach to the tspNetworks, 1977
- Procedures for Estimating Optimal Solution Values for Large Combinatorial ProblemsManagement Science, 1977
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973