A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems.
Elspeth AdamsMiguel F. AnjosFranz RendlAngelika WiegelePublished in: INFOR Inf. Syst. Oper. Res. (2015)
Keyphrases
- semidefinite
- np hard
- maximum weight
- optimization problems
- semidefinite programming
- linear programming
- convex relaxation
- graph mining
- interior point methods
- approximation algorithms
- metaheuristic
- optimization methods
- optimal solution
- sufficient conditions
- cost function
- special case
- lower bound
- objective function
- evolutionary algorithm
- linear program
- higher dimensional
- primal dual
- convex sets
- hyperplane
- worst case
- pairwise