A discrete dynamic convexized method for the max-cut problem
Year of publication: |
2012
|
---|---|
Authors: | Lin, Geng ; Zhu, Wenxing |
Published in: |
Annals of operations research. - New York, NY [u.a.] : Springer Science + Business Media, ISSN 0254-5330, ZDB-ID 2526293. - Vol. 196.2012, 1, p. 371-391
|
Saved in:
Saved in favorites
Similar items by person
-
A dynamic convexized method for nonconvex mixed integer nonlinear programming
Zhu, Wenxing, (2011)
-
Max-k-cut by the discrete dynamic convexized method
Zhu, Wenxing, (2013)
-
A discrete dynamic convexized method for the max-cut problem
Lin, Geng, (2012)
- More ...