Max-k-Cut by the Discrete Dynamic Convexized Method
Year of publication: |
2013
|
---|---|
Authors: | Zhu, Wenxing ; Lin, Geng ; Ali, M. M. |
Published in: |
INFORMS journal on computing : JOC. - Linthicum, Md : INFORMS, ISSN 0899-1499, ZDB-ID 13160771. - Vol. 25.2013, 1, p. 27-40
|
Saved in:
Saved in favorites
Similar items by person
-
Max-k-cut by the discrete dynamic convexized method
Zhu, Wenxing, (2013)
-
An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable
Lin, Geng, (2011)
-
A dynamic convexized method for nonconvex mixed integer nonlinear programming
Zhu, Wenxing, (2011)
- More ...