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

INFOR - Canada
doi 10.3138/infor.53.1.40
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

LP Relaxations of Some NP-Hard Problems Are as Hard as Any LP

2017English

Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Semidefinite Programming Relaxations Through Quadratic Reformulation for Box-Constrained Polynomial Optimization Problems

2019English

Reoptimization of NP-Hard Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Exact Algorithms for NP-Hard Problems: A Survey

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

When Subgraph Isomorphism Is Really Hard, and Why This Matters for Graph Databases

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

The Power of Semidefinite Programming Relaxations for MAX-SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Scalar Projection and Angle-Based Evolutionary Algorithm for Many-Objective Optimization Problems

IEEE Transactions on Cybernetics
ControlSystems EngineeringInformation SystemsHuman-Computer InteractionElectronic EngineeringComputer Science ApplicationsElectricalSoftware
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy