A discrete dynamic convexized method for the max-cut problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Geng Lin, Wenxing Zhu. A discrete dynamic convexized method for the max-cut problem. Annals OR, 196(1):371-390, 2012. [doi]

The following publications are possibly variants of this publication:

k-Cut by the Discrete Dynamic Convexized MethodWenxing Zhu, Geng Lin, M. M. Ali. informs, 25(1):27-40, 2013. [doi]

An effective discrete dynamic convexized method for solving the winner determination problemGeng Lin, Wenxing Zhu, M. Montaz Ali. jco, 32(2):563-593, 2016. [doi]

Solving the weighted MAX-SAT problem using the dynamic convexized methodWenxing Zhu, Yuanhui Yan. ol, 8(1):359-374, 2014. [doi]

A discrete dynamic convexized method for VLSI circuit partitioningJiarui Chen, Wenxing Zhu. oms, 28(4):670-688, 2013. [doi]

runs on WebDSL