经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems.The emphasis was on the travelling salesman problems,minimal spanning trees,matching and lengths of the longest increasing subsequences.Probability limit theorems surveyed mai...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2000-11-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/zjup/1008-9497.2000.27.6.700-713 |
| Summary: | A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems.The emphasis was on the travelling salesman problems,minimal spanning trees,matching and lengths of the longest increasing subsequences.Probability limit theorems surveyed mainly involved strong laws of large numbers,rates of convergence,convergence in distribution and large deviation principles.No proofs were given.Some of the main open problems were described. |
|---|---|
| ISSN: | 1008-9497 |