Semidefinite Programming in Combinatorial Optimization

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

Type

Journal article

Intellectual base

Primary research

Year

1997

Pages

143-161

DOI

10.1007/bf02614315

DOI registrant

Springer Nature

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

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

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