#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2014

2018

- This year (1)
- Last 5 years (9)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Zhaocai Wang, Jian Tan, Dongmei Huang, Yingchao Ren, Zuwen Ji
- Applied Mathematics and Computation
- 2014

Abstract The assignment problem (AP) is to optimally solve the task of assigning n jobs to n individuals, such that minimum cost or maximum profit can be obtained. It is a vitally important… (More)

The subset sum problem is to find subsets in a given number set, meanwhile number sum of the subset is equal to appointed value. It is a classical NP-complete problem in graph theory. It can be… (More)

The maximum weighted clique (MWC) problem, as a typical NP-complete problem, is difficult to be solved by the electronic computer algorithm. The aim of the problem is to seek a vertex clique with… (More)

- Zhaocai Wang, Zuwen Ji, Xiaoming Wang, Tunhua Wu, Wei Liang Huang
- Biosystems
- 2017

As a promising approach to solve the computationally intractable problem, the method based on DNA computing is an emerging research area including mathematics, computer science and molecular biology.… (More)

- Zuwen Ji, Zhaocai Wang, Tunhua Wu, Wei Huang
- Journal of Intelligent and Fuzzy Systems
- 2017

The 0-1 knapsack problem is one of the classical NP-hard problems and has been one of the hot research topics in the last few decades. It offers many practical applications in optimization and… (More)

- Zhaocai Wang, Zuwen Ji, Ziyi Su, Xiaoming Wang, Kai Zhao
- 2016

The maximal matching problem (MMP) is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in… (More)

- Zhaocai Wang, Zuwen Ji, Lei Li, Dongmei Huang
- 2015

- Zuwen Ji, Wenhong Cao, Zhaocai Wang, Yufang Qin, Lei Li
- 2015

- ‹
- 1
- ›