On semidefinite programming relaxations for the satisfiability problem期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

On semidefinite programming relaxations for the satisfiability problem

Authors:	Miguel F.?Anjos author-information" > author-information__contact u-icon-before" > mailto:anjos@stanfordalumni.org" title=" anjos@stanfordalumni.org" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author

Affiliation:	(1) Operational Research Group, School of Mathematics, University of Southampton, Southampton, SO17 1BJ, United Kingdom

Abstract:

Keywords:	Satisfiability problem Semidefinite programming Combinatorial optimization Global optimization
本文献已被 SpringerLink 等数据库收录！