Bibliography

1

S. J. Benson.
Parallel computing on semidefinite programs.
Technical Report ANL/MCS-P939-0302, Mathematics and Computer Science Division, Argonne National Laboratory, March 2003.

2

S. J. Benson and Y. Ye.
Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation.
In Applications and Algorithms of Complementarity, volume 50 of Applied Optimization, pages 1-18. Kluwer Academic Publishers, 2000.

3

S. J. Benson and Y. Ye.
DSDP3: Dual-scaling algorithm for general positive semidefinite programming.
Technical Report ANL/MCS-P851-1000, Mathematics and Computer Science Division, Argonne National Laboratory, February 2001.

4

S. J. Benson and Y. Ye.
DSDP4: A software package implementing the dual-scaling algorithm for semidefinite programming.
Technical Report ANL/MCS-TM-255, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, June 2002.

5

S. J. Benson, Y. Ye, and X. Zhang.
Mixed linear and semidefinite programming for combinatorial and quadratic optimization.
Optimization Methods and Software, 11:515-544, 1999.

6

S. J. Benson, Y. Ye, and X. Zhang.
Solving large-scale sparse semidefinite programs for combinatorial optimization.
SIAM Journal on Optimization, 10(2):443-461, 2000.

7

DIMACS.
The Seventh DIMACS Implementation Challenge: 1999-2000.
http://dimacs.rutgers.edu/Challenges/Seventh/, 1999.

8

Hans D. Mittelmann.
SDPLIB benchmarks.
ftp://plato.asu.edu/pub/sdplib.txt, 2003.

9

Robert A. van de Geijn.
Using PLAPACK: Parallel Linear Algebra Package.
Scientific and Engineering Computing. MIT Press, Cambridge, MA, 1997.
http://www.cs.utexas.edu/users/plapack.