Back to search

North Dakota State University

A Closed Form Optimization Model for The Conflict Neutralization Problem

Abstract

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.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2010

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Yan

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/33546

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wang, Yan. A Closed Form Optimization Model for The Conflict Neutralization Problem. North Dakota State University, 2010. https://hdl.handle.net/10365/33546