DSDP
|
Functions | |
int | MaxCutRandomized (SDPCone sdpcone, int nnodes) |
Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut problem. | |
int | StableRandomized (SDPCone sdpcone, int nodes, int edges, EdgeMat Edge[]) |
Apply a randomized procedure to find feasible stable sets. | |
Examples that formulate problems in DSDP Standard Form. and solve them using DSDP.
int MaxCutRandomized | ( | SDPCone | sdpcone, |
int | nnodes | ||
) |
Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut problem.
int MaxCutRandomized(SDPCone sdpcone,int nnodes);
sdpcone | the SDP cone |
nnodes | number of nodes in the graph |
int StableRandomized | ( | SDPCone | sdpcone, |
int | nodes, | ||
int | edges, | ||
EdgeMat | Edge[] | ||
) |
Apply a randomized procedure to find feasible stable sets.
int StableRandomized(SDPCone sdpcone,int nodes, int edges, EdgeMat Edge[]);
sdpcone | the SDP cone |
nodes | number of nodes in the graph |
edges | number of edges in the graph |
Edge | Array of edges |