Browse by Keywords

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Number of items: 5.

Chimani, Markus and Hungerländer, Philipp and Jünger, Michael and Mutzel, Petra (2011) An SDP approach to multi-level crossing minimization.
Published In: Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX 2011) SIAM March 2011, pp. 116-126.

Ghaddar, Bissan and Anjos, Miguel and Liers, Frauke (2007) A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.
Published in: Annals of Operations Research Vol. 188 (1). pp. 155-174.

Anjos, Miguel (2002) An Improved Semidefinite Programming Relaxation for the Satisfiability Problem.
Published in: Mathematical Programming Vol. 102 (3). pp. 589-608.

Srivastav, Anand and Wolf, Katja (1998) Finding Dense Subgraphs with Semidefinite Programming.
Published In: Approximation algorithms for combinatorial optimization : proceedings / International Workshop APPROX '98, Aalborg, Denmark, July 18 - 19, 1998, Lecture notes in computer science. 1444 Springer 1998, pp. 181-191.

Hochstättler, Winfried (1996) Semidefinite Programmierung.
Technical Report , 95 p.

This list was generated on Sat Sep 23 22:10:37 2017 CEST.