40 citations · 61 across the 13 of their papers we have counts for
13 papers
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
Jitao Xu, Hongbo Li, Minghao Yin
The 0-1 Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem with many engineering applications. In this paper, we propose a novel algo…
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
Luzhi Wang, Chu-Min Li, Junping Zhou +2
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly solve the minimum weight vertex cover problem (MWVC) in large graphs. The original contribution is several…
Diversified Top-k Partial MaxSAT Solving
Junping Zhou, Huanyao Sun, Feifei Ma +3
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem. Given a partial MaxSAT formula F and a positive integer k,…
Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
Yiyuan Wang, Shaowei Cai, Minghao Yin
The Minimum Weight Dominating Set (MWDS) problem is an important generalization of the Minimum Dominating Set (MDS) problem with extensive applications. This paper proposes a new l…
Augmenting Ordered Binary Decision Diagrams with Conjunctive Decomposition
Yong Lai, Dayou Liu, Minghao Yin
This paper augments OBDD with conjunctive decomposition to propose a generalization called OBDD[]. By imposing reducedness and the finest -decomposition bounded by…
Approximate Counting CSP Solutions Using Partition Function
Junping Zhou, Weihua Su, Minghao Yin
We propose a new approximate method for counting the number of the solutions for constraint satisfaction problem (CSP). The method derives from the partition function based on intr…