Li Cheng, Congjun Rao, Lin Chen, Isnaini Rosyida
The traditional maximum cut problem assumes that the edge weights are crisp values or random variables. However, the edge weight in maximum cut problem has real and concrete implications in real life application, so it is more suitable to characterize the edge weights as uncertain variables. In this paper, the maximum cut problem in uncertain environment is considered. We originally propose a belief degree constrained programming model for uncertain maximum cut problem. Furthermore, we convert the model into its equivalent deterministic form which can be solved by classic programming methods. Finally, a numerical example is presented to show the application of the model. © 2016 ICIC International.
College of Mathematics and Physics, Huanggang Normal University, No. 146 Xingang 2 Road, Huanggang, 438000, China; Institute of Systems Engineering, Tianjin University, No. 92 Weijin Road Nankai District, Tianjin, 300072, China; Department of Mathematics, Semarang State University, Semarang, 50229, Indonesia
