| dc.contributor.author | Wang, Yan | |
| dc.description.abstract | In this study, we proposed a novel closed form optimization model for the
Conflict Neutralization Problem (CKP) and implemented an efficient algorithm for
solving the problem. A novel tableau representation of the CNP model was presented
and described in detail. We implemented a special structured branch and bound
algorithm to solve the problem. Key components of the implementation were described.
To test the computation performance of our algorithm, we designed and conducted
three sets of experiments. The experiment results were reported and analyzed in this
report. The test results showed the efficiency of the algorithm for solving the Conflict
Neutralization Problem. | en_US |
| dc.publisher | North Dakota State University | en_US |
| dc.rights | NDSU policy 190.6.2 | en_US |
| dc.title | A Closed Form Optimization Model for The Conflict Neutralization Problem | en_US |
| dc.type | Thesis | en_US |
| dc.date.accessioned | 2024-01-03T22:04:47Z | |
| dc.date.available | 2024-01-03T22:04:47Z | |
| dc.date.issued | 2010 | |
| dc.identifier.uri | https://hdl.handle.net/10365/33546 | |
| dc.subject.lcsh | Branch and bound algorithms. | en_US |
| dc.subject.lcsh | Mathematical optimization. | en_US |
| dc.subject.lcsh | Operations research. | en_US |
| dc.rights.uri | https://www.ndsu.edu/fileadmin/policy/190.pdf | en_US |
| ndsu.degree | Master of Science (MS) | en_US |
| ndsu.college | Engineering | en_US |
| ndsu.department | Computer Science | en_US |
| ndsu.program | Computer Science | en_US |
| ndsu.advisor | Nygard, Kendall | |
