2 citations · 6 across the 6 of their papers we have counts for
6 papers
An Efficient Evolutionary Algorithm for Diversified Top-k (Weight) Clique Search Problems
Jiongzhi Zheng, Jinghui Xue, Kun He +2
In many real-world problems and applications, finding only a single element, even though the best, among all possible candidates, cannot fully meet the requirements. We may wish to…
An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere
Jianrong Zhou, Shuo Ren, Kun He +2
The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applicati…
Solving the n-color ice model
Patrick Addona, Ethan Bockenhauer, Ben Brubaker +14
Given an arbitrary choice of two sets of nonzero Boltzmann weights for -color lattice models, we provide explicit algebraic conditions on these Boltzmann weights which guarantee…
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Yanli Liu, Jiming Zhao, Chu-Min Li +2
Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for…
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…
A Learning based Branch and Bound for Maximum Common Subgraph Problems
Yan-li Liu, Chu-min Li, Hua Jiang +1
Branch-and-bound (BnB) algorithms are widely used to solve combinatorial problems, and the performance crucially depends on its branching heuristic.In this work, we consider a typi…