摘要
问题的复杂性概念起源于离散的图灵计算机理论的研究,在离散优化问题的研究中被广泛的接受.近期连续优化领域的很多文章中提及NP难这个概念.从而来对比介绍离散优化和连续优化研究中这两个概念的差异.
Complexity concepts oriented from the theoretical Turing machine are widely accepted in study of combinatorial optimization problems. The polynomially computable and NP-hard concepts are frequently used in recent papers on continuous optimization problems. This paper presents a very brief introduction to show their relationship and difference used in the two fields.
出处
《运筹学学报》
CSCD
北大核心
2017年第2期39-45,共7页
Operations Research Transactions
基金
国家自然科学基金(No.11571029)
关键词
复杂性概念
离散优化
连续优化
complexity concepts, combinatorial optimization, continuous optimization
