Cutting Plane Algorithms for Semidefinite Relaxations

@inproceedings{Helmberg1997CuttingPA,
  title={Cutting Plane Algorithms for Semidefinite Relaxations},
  author={Christoph Helmberg and Robert WeismanteF},
  year={1997}
}

From This Paper

Figures, tables, and topics from this paper.
5 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Borchers Solving real - world linear o rde rng problems using a p r i m a l d u a l interior point cutting plane method

  • C. Uhrig, A.
  • Annals of Operations Rearch
  • 1996

Maximum cuts and large biparti te subgraphs

  • L. Tuncel.
  • Di - macs Series in Discrete Mathematics ad…
  • 1995

Rendl Connections between semidefinite relaxations of the maxcut and stable set problems

  • S. Poljak, F.
  • 1995

Nemirovskii InteriorPoint Polynomial Algorithms in Conve Programming

  • M. J. Todd
  • SIAM Studies in pplied Mathematics , Philadel…
  • 1993

Similar Papers

Loading similar papers…