Maximum cut problem: new models
In the paper, we present the maximum cut problem as maximization of a non-smooth convex function over polytope which is the convex hull of bases of the polymatroid associated with a submodular function defined on the subsets of node set of a given graph. We also formulate other new models for this p...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Balikesir University
2020-01-01
|
Series: | An International Journal of Optimization and Control: Theories & Applications |
Subjects: | |
Online Access: | http://www.ijocta.org/index.php/files/article/view/826 |