optimal for max-cut problem\AddOneStep.m
...........................\ConditionMatrix.asv
...........................\ConditionMatrix.m
...........................\ConstrainMatrix.asv
...........................\ConstrainMatrix.m
...........................\ExactMaxCut.asv
...........................\ExactMaxCut.m
...........................\FindIndex.m
...........................\FullLabOnce.m
...........................\Initial.asv
...........................\Initial.m
...........................\lab.m
...........................\LocationMatrix.m
...........................\main.asv
...........................\main.m
...........................\NumToVec.asv
...........................\NumToVec.m
...........................\Show.asv
...........................\SolveOnce.asv
...........................\SolveOnce.m
...........................\SolvePolynomial.asv
...........................\SolvePolynomial.m
...........................\SubSolve.asv
...........................\SubSolve.m
...........................\SubTable.m
...........................\Table.m
...........................\test.xls
...........................\ThetaCombine.m
...........................\VecToNum.m
...........................\ZeroOneConstrain.asv
...........................\ZeroOneConstrain.m
...........................\多项式优化算法(可以工作的第一版).rar
...........................\.杂Ρ韁AddOneStep.asv
...........................\......\AddOneStep.m
...........................\......\FindIndex.asv
...........................\......\FindIndex.m
...........................\......\main.m
...........................\......\SubTable.m
...........................\......\Table.asv
...........................\......\Table.m
...........................\对应表
...........................\最大割问题N=2.xls
...........................\最大割问题N=2n=4-10.xls
...........................\最大割问题N=2n=4-12.xls
...........................\最大割问题N=3.xls
...........................\结果记录.txt
optimal for max-cut problem