Maximum cut problem: new models
-
Published:2020-01-31
Issue:1
Volume:10
Page:104-112
-
ISSN:2146-5703
-
Container-title:An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
-
language:
-
Short-container-title:Int. J. Optim. Control, Theor. Appl. (IJOCTA)
Author:
Kutucu HakanORCID,
Sharifov FirdovsiORCID
Abstract
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 problem and give necessary and enough conditions on an optimal solution in terms of network flow.
Publisher
International Journal of Optimization and Control: Theories and Applications
Subject
Applied Mathematics,Control and Optimization