A hierarchy of subgraph projection-based semidefinite relaxations for some NP-hard graph optimization problems
| Year of publication: |
February 2015
|
|---|---|
| Authors: | Adams, Elspeth ; Anjos, Miguel F. ; Rendl, Franz ; Wiegele, Angelika |
| Published in: |
INFOR : information systems and operational research. - Ottawa : INFOR Journal, ISSN 0315-5986, ZDB-ID 121260-6. - Vol. 53.2015, 1, p. 40-48
|
| Subject: | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory | Hierarchie | Hierarchy |
-
Evolutionary hierarchical credibility
Taylor, Greg, (2018)
-
The hierarchical mixed rural postman problem
Colombi, Marco, (2017)
-
Integration and hierarchy of pork markets in the EU : an analysis from the vantage of graph theory
Fousekis, Panajiotis, (2019)
- More ...
-
Using a factored dual in augmented Lagrangian methods for semidefinite programming
De Santis, Marianna, (2018)
-
Proofs of unsatisfiability via semidefinite programming
Anjos, Miguel F., (2004)
-
Anjos, Miguel F., (2020)
- More ...