Main Page | Modules | Alphabetical List | Data Structures | Directories | File List | Globals | Related Pages

maxcut.c File Reference


Detailed Description

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.

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.
int MaxCutRandomized (SDPCone, int)
 Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut problem.


Generated on Fri Oct 21 14:28:38 2005 for DSDP by  doxygen 1.4.2