学术探索
学术期刊
新闻热点
数据分析
智能评审

RANDOMIZED ALGORITHMS IN COMBINATORIAL OPTIMIZATION - A SURVEY

被引：9
作者：
MAFFIOLI, F
机构：
[1] Politechnico di Milano, Milan, Italy, Politechnico di Milano, Milan, Italy
来源：
DISCRETE APPLIED MATHEMATICS | 1986年 / 14卷 / 02期
关键词：
D O I：
10.1016/0166-218X(86)90058-2
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
39
引用
收藏
页码：157 / 170
页数：14
相关论文
共 40 条
[1]   FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J].
ANGLUIN, D ;
VALIANT, LG .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) :155-193
[2]  
BURKARD RE, 1984, EUR J OPL RES, V17, P167
[3]  
CAMERINI PM, 1986, MATH PROGRAM STUD, V26, P229, DOI 10.1007/BFb0121102
[4]  
CAMERINI PM, SIAM J ALGEBRAIC DIS, P426
[5]  
DAMIANI M, 1984, THESIS POLITECNICO M
[6]   PROCEDURES FOR ESTIMATING OPTIMAL SOLUTION VALUES FOR LARGE COMBINATORIAL PROBLEMS [J].
DANNENBRING, DG .
MANAGEMENT SCIENCE, 1977, 23 (12) :1273-1283
[7]   Limiting forms of the frequency distribution of the largest or smallest member of a sample [J].
Fisher, RA ;
Tippett, LHC .
PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1928, 24 :180-190
[8]  
Freivalds Rusins, 1977, IFIP C, V839, P842
[9]  
FRIEDENBACH K, 1974, H8 U CAL SANT CRUZ D
[10]  
FUMAGALLI V, 1982, THESIS POLITECNICO M
1234