<  Back to the Polytechnique Montréal portal

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

Elspeth Adams, Miguel F. Anjos, Franz Rendl and Angelika Wiegele

Technical Report (2013)

An external link is available for this item
Department: Department of Mathematics and Industrial Engineering
Research Center: GERAD - Research Group in Decision Analysis
PolyPublie URL: https://publications.polymtl.ca/63964/
Report number: G-2013-80
Official URL: https://www.gerad.ca/fr/papers/G-2013-80
Date Deposited: 30 Apr 2025 16:01
Last Modified: 30 Apr 2025 16:01
Cite in APA 7: Adams, E., Anjos, M. F., Rendl, F., & Wiegele, A. (2013). A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for some NP-Hard Graph Optimization Problems. (Technical Report n° G-2013-80). https://www.gerad.ca/fr/papers/G-2013-80

Statistics

Stats are not available on this system.

Repository Staff Only

View Item View Item