Semidefinite Programming in Combinatorial Optimization

Goemans, M. X. (1997). Semidefinite Programming in Combinatorial Optimization. Mathematical Programming.

Type

Journal article

Intellectual base

Primary research

Year

1997

DOI

10.1007/bf02614315

Link

https://doi.org/10.1007/BF02614315

Cited by

1 citation across 1 artifact.

Domain-specific

• Square-Root Sum Problem
  • The direction of the threshold matters, and approximation algorithms for SDP do not automatically settle exact feasibility at a boundary.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3ed6c816e832 · see in the full table