The parpose of this paper is to show the main progresses in combinatorial optimization from the point of view of the theory of NP- Completeness in com-puting complexity although only Boalean methods are discussed. Meanwhile, we also propose a number of unsolved problems with some possible approaches for further research. |