DSDP
|
Most Basic Example: read graph from file, formulate the SDP relaxation of maximum cut problem, solve using DSDP, and apply randomized algorithm to generate approximate solutions. More...
Go to the source code of this file.
Functions | |
int | MaxCut (int, int, int[], int[], double[]) |
Formulate and solve the SDP relaxation of the Maximum Cut problem. More... | |
int | MaxCutRandomized (SDPCone sdpcone, int nnodes) |
Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut problem. More... | |
Most Basic Example: read graph from file, formulate the SDP relaxation of maximum cut problem, solve using DSDP, and apply randomized algorithm to generate approximate solutions.
Definition in file maxcut.c.