Similar Search Results

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules

Ji, Pengli; He, Kun; Yan, Jin; Lan, Hongsheng; Li, Chu-Min - In: Computers & operations research : and their … 86 (2017), pp. 110-123

Persistent link: https://www.econbiz.de/10011732238

An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere

Zhou, Jianrong; Ren, Shuo; He, Kun; Liu, Yanli; Li, Chu-Min - 2023

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 applications in industry. This problem is computationally challenging, and many efforts focus on small-scale instances with...

Persistent link: https://www.econbiz.de/10014360670

An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem

Xu, Zhenxing; He, Kun; Li, Chu-Min - In: Computers & operations research : and their … 104 (2019), pp. 49-58

Persistent link: https://www.econbiz.de/10011991172

An efficient solution space exploring and descent method for packing equal spheres in a sphere

Zhou, Jianrong; Ren, Shuo; He, Kun; Liu, Yanli; Li, Chu-Min - In: Computers & operations research : an international journal 164 (2024), pp. 1-32

Persistent link: https://www.econbiz.de/10014562888

A vertex weighting-based double-tabu search algorithm for the classical p-center problem

Zhang, Qingyun; Lü, Zhipeng; Su, Zhouxing; Li, Chu-Min - In: Computers & operations research : and their … 160 (2023), pp. 1-15

Persistent link: https://www.econbiz.de/10014434460

A new upper bound for the maximum weight clique problem

Li, Chu-Min; Liu, Yanli; Jiang, Hua; Manyà, Felip; Li, Yu - In: European journal of operational research : EJOR 270 (2018) 1, pp. 66-77

Persistent link: https://www.econbiz.de/10011868925

Incremental upper bound for the maximum clique problem

Li, Chu-Min; Fang, Zhiwen; Jiang, Hua; Xu, Ke - In: INFORMS journal on computing : JOC 30 (2018) 1, pp. 137-153

Persistent link: https://www.econbiz.de/10011848219

On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

Li, Chu-Min; Jiang, Hua; Manyà, Felip - In: Computers & operations research : and their … 84 (2017), pp. 1-15

Persistent link: https://www.econbiz.de/10011710166

Solving longest common subsequence problems via a transformation to the maximum clique problem

Blum, Christian; Djukanovic, Marko; Santini, Alberto; … - In: Computers & operations research : and their … 125 (2021), pp. 1-17

Persistent link: https://www.econbiz.de/10012390324

Local search for diversified top-k clique search problem

Wu, Jun; Li, Chu-Min; Jiang, Lu; Zhou, Junping; Yin, Minghao - In: Computers & operations research : and their … 116 (2020), pp. 1-9

Persistent link: https://www.econbiz.de/10012164802