彼得·哈默,刘彦佩,布鲁诺·席莫昂.组合最优化中的布尔方法(续二)[J].数学研究及应用,1990,10(4):619~628
组合最优化中的布尔方法(续二)
Boolean Approaches to Combinatorial Optimization
  
DOI:10.3770/j.issn:1000-341X.1990.04.036
中文关键词:  
英文关键词:
基金项目:
作者单位
彼得·哈默 RUTCOR
The State University of New Jersey
U. S. A. 
刘彦佩 Institute of Applied Mathematics
Academia Sinica
China 
布鲁诺·席莫昂 Dipartimento di Statistica
Probabilita e Statistiche Applicate
Universita di Roma "La Sapienza"
Itala 
摘要点击次数: 2133
全文下载次数: 1031
中文摘要:
      
英文摘要:
      The parpose of this paper is to show the main progresses in combinatorial optimization from the point of view of the theory of NP- Completeness in com-puting complexity although only Boalean methods are discussed. Meanwhile, we also propose a number of unsolved problems with some possible approaches for further research.
查看全文  查看/发表评论  下载PDF阅读器