首页    期刊浏览 2024年11月24日 星期日
登录注册

文章基本信息

  • 标题:Computational Complexity, NP Completeness and Optimization Duality: A Survey
  • 本地全文:下载
  • 作者:Prabhu Manyem, Julien Ugon
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2012
  • 卷号:2012
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:We survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimization problems on the other. To our knowledge, this is the first survey that connects the two very important areas. We further look at a similar phenomenon in finite model theory relating to complexity and optimization.
  • 关键词:Computational Complexity, Duality, Duality gap, finite model theory, mathematical programming, optimization
国家哲学社会科学文献中心版权所有