经典组合优化问题的概率极限定理(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...

Full description

Bibliographic Details
Main Author: SUZhong-gen(苏中根)
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
_version_ 1797236523879366656
author SUZhong-gen(苏中根)
author_facet SUZhong-gen(苏中根)
author_sort SUZhong-gen(苏中根)
collection DOAJ
description 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.
first_indexed 2024-04-24T17:05:13Z
format Article
id doaj.art-d7be5e72ae5a44fab2af67514cb3136e
institution Directory Open Access Journal
issn 1008-9497
language zho
last_indexed 2024-04-24T17:05:13Z
publishDate 2000-11-01
publisher Zhejiang University Press
record_format Article
series Zhejiang Daxue xuebao. Lixue ban
spelling doaj.art-d7be5e72ae5a44fab2af67514cb3136e2024-03-29T01:58:16ZzhoZhejiang University PressZhejiang Daxue xuebao. Lixue ban1008-94972000-11-01276700713zjup/1008-9497.2000.27.6.700-713经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)SUZhong-gen(苏中根)0(Department of Mathematics, Zhejiang University, Hangzhou 310028,China)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.https://doi.org/zjup/1008-9497.2000.27.6.700-713limit theoremsmatchingminimal spanning treestravelling salesman problems
spellingShingle SUZhong-gen(苏中根)
经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
Zhejiang Daxue xuebao. Lixue ban
limit theorems
matching
minimal spanning trees
travelling salesman problems
title 经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
title_full 经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
title_fullStr 经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
title_full_unstemmed 经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
title_short 经典组合优化问题的概率极限定理(Probability limit theorems of classical combinatorial optimization problems)
title_sort 经典组合优化问题的概率极限定理 probability limit theorems of classical combinatorial optimization problems
topic limit theorems
matching
minimal spanning trees
travelling salesman problems
url https://doi.org/zjup/1008-9497.2000.27.6.700-713
work_keys_str_mv AT suzhonggensūzhōnggēn jīngdiǎnzǔhéyōuhuàwèntídegàilǜjíxiàndìnglǐprobabilitylimittheoremsofclassicalcombinatorialoptimizationproblems