9 citations · 18 across the 6 of their papers we have counts for
6 papers
A heuristic method for data allocation and task scheduling on heterogeneous multiprocessor systems under memory constraints
Junwen Ding, Liangcai Song, Siyuan Li +4
Computing workflows in heterogeneous multiprocessor systems are frequently modeled as directed acyclic graphs of tasks and data blocks, which represent computational modules and th…
Clause Vivification by Unit Propagation in CDCL SAT Solvers
Chu-Min Li, Fan Xiao, Mao Luo +3
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant…
Path Relinking for Bandwidth Coloring Problem
Xiangjing Lai, Zhipeng Lu, Jin-Kao Hao +2
A Path Relinking algorithm is proposed for the Bandwidth Coloring problem and the Bandwidth MultiColoring problem. It combines a population based relinking method and a tabu search…
A Multi-parent Memetic Algorithm for the Linear Ordering Problem
Tao Ye, Tao Wang, Zhipeng Lu +1
In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a mult…
A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem
Bo Peng, Zhipeng Lu, T. C. E. Cheng
We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relink…
Solving the minimum sum coloring problem via binary quadratic programming
Yang Wang, Jin-Kao Hao, Fred Glover +1
In recent years, binary quadratic programming (BQP) has been successively applied to solve several combinatorial optimization problems. We consider in this paper a study of using t…