A BELIEF DEGREE CONSTRAINED PROGRAMMING MODEL FOR MAXIMUM CUT PROBLEM WITH UNCERTAIN EDGE WEIGHTS
Isnaini, Rosyida and Li, Cheng (2016) A BELIEF DEGREE CONSTRAINED PROGRAMMING MODEL FOR MAXIMUM CUT PROBLEM WITH UNCERTAIN EDGE WEIGHTS. ICIC Express Letters Part B: Applications, 7 (6). pp. 1-7. ISSN 2185-2766
PDF
Download (109kB) |
Abstract
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 char- acterize 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.
Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics |
Fakultas: | Fakultas Matematika dan Ilmu Pengetahuan Alam > Matematika, S1 |
Depositing User: | Setyarini UPT Perpus |
Date Deposited: | 03 Aug 2022 02:27 |
Last Modified: | 03 Aug 2022 02:27 |
URI: | http://lib.unnes.ac.id/id/eprint/44416 |
Actions (login required)
View Item |