The time complexity of maximum matching by simulated annealing
- 1 April 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (2), 387-403
- https://doi.org/10.1145/42282.46160
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Cooling Schedules for Optimal AnnealingMathematics of Operations Research, 1988
- Simulated annealing methods with general acceptance probabilitiesJournal of Applied Probability, 1987
- Convergence and finite-time behavior of simulated annealingAdvances in Applied Probability, 1986
- Simulated Annealing Without Rejected MovesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Global Wiring by Simulated AnnealingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1983
- Hitting-time and occupation-time bounds implied by drift analysis with applicationsAdvances in Applied Probability, 1982
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973