A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph optimization problems

E Adams, MF Anjos, F Rendl… - … : Information Systems and …, 2015 - Taylor & Francis
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …
被引用次数：15 相关文章
[PDF] optimization-online.org

[PDF][PDF] A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems

E Adams, MF Anjos, F Rendl, A Wiegele - optimization-online.org
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems

E Adams, MF Anjos, F Rendl… - … : Information Systems and …, 2015 - research.ed.ac.uk
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …
[PDF] core.ac.uk

[PDF][PDF] A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems

E Adams, MF Anjos, F Rendl, A Wiegele - 2019 - core.ac.uk
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …
[PDF] archive.org

[PDF][PDF] A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems

E Adams, MF Anjos, F Rendl, A Wiegele - 2019 - scholar.archive.org
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …

[引用][C] A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph optimization problems

E Adams, MF Anjos, F Rendl, A Wiegele - INFOR, 2015 - publications.polymtl.ca
A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph
optimization problems - PolyPublie < Retour au portail Polytechnique Montréal English Accueil …
[PDF] ed.ac.uk

[PDF][PDF] A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems

E Adams, MF Anjos, F Rendl, A Wiegele - 2019 - pure.ed.ac.uk
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …

A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems.

E Adams, MF Anjos, F Rendl, A Wiegele - INFOR, 2015 - search.ebscohost.com
Many important NP-hard combinatorial problems can be efficiently approximated using
semidefinite programming relaxations. We propose a new hierarchy of semidefinite …