DSDP
|
Functions | |
int | DSDPPrintData (DSDP dsdp, SDPCone sdpcone, LPCone lpcone) |
Print data in SDPA format to a file named "output.sdpa". More... | |
int | DSDPPrintSolution (FILE *fp, DSDP dsdp, SDPCone sdpcone, LPCone lpcone) |
Print solution in SDPA format. More... | |
int | LovaszTheta (int argc, char *argv[]) |
Formulate and solve the Lovasz theta problem. More... | |
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... | |
void | mexFunction (int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) |
Call DSDP from the Matlab environment. More... | |
int | MinColoring (int argc, char *argv[]) |
SDP relaxation of k-coloring problem. More... | |
int | ReadSDPAFile (int argc, char *argv[]) |
Read SDPA formatted file and solve the semidefinite program. More... | |
int | SetStableSetData (DSDP, SDPCone, int, int, EdgeMat[]) |
Given a graph, formulate maximum Stable Set problem and place data into solver. More... | |
int | SetThetaData (DSDP, SDPCone, int, int, EdgeMat[]) |
Given a graph, formulate Lovasz problem and set data. More... | |
int | StableRandomized (SDPCone sdpcone, int nodes, int edges, EdgeMat Edge[]) |
Apply a randomized procedure to find feasible stable sets. More... | |
int | StableSet (int argc, char *argv[]) |
Formulate and solve the maximum Stable Set problem. More... | |
Examples that formulate problems in DSDP Standard Form. and solve them using DSDP.
Print data in SDPA format to a file named "output.sdpa".
dsdp | the solver |
sdpcone | semidefinite cone |
lpcone | LP cone |
Definition at line 164 of file printsdpa.c.
Print solution in SDPA format.
fp | file pointer |
dsdp | the solver |
sdpcone | semidefinite cone |
lpcone | LP cone |
Definition at line 94 of file printsdpa.c.
int LovaszTheta | ( | int | argc, |
char * | argv[] | ||
) |
Formulate and solve the Lovasz theta problem.
argc | number of command line arguments |
argv | command line arguments |
int MaxCut | ( | int | nnodes, |
int | nedged, | ||
int | node1[], | ||
int | node2[], | ||
double | weight[] | ||
) |
Formulate and solve the SDP relaxation of the Maximum Cut problem.
nnodes | number of nodes in graph |
nedges | number of edges in graph |
node1 | first node of each edge |
node2 | second node of each edge |
weight | weight of each edge |
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 |
void mexFunction | ( | int | nlhs, |
mxArray * | plhs[], | ||
int | nrhs, | ||
const mxArray * | prhs[] | ||
) |
int MinColoring | ( | int | argc, |
char * | argv[] | ||
) |
int ReadSDPAFile | ( | int | argc, |
char * | argv[] | ||
) |
Read SDPA formatted file and solve the semidefinite program.
argc | number of command line arguments |
argv | command line arguments |
Definition at line 80 of file readsdpa.c.
Given a graph, formulate Lovasz problem and set data.
dsdp | the solver |
sdpcone | the semidefinite cone |
nodes | number of nodes in graph |
edges | number of edges in graph |
Edge | edges in 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 |
int StableSet | ( | int | argc, |
char * | argv[] | ||
) |
Formulate and solve the maximum Stable Set problem.
argc | number of command line arguments |
argv | command line arguments |