1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.AI2024
Local Search for Integer Quadratic Programming
Xiang He, Peng Lin, Shaowei Cai
Integer Quadratic Programming (IQP) is an important problem in operations research. Local search is a powerful method for solving hard problems, but the research on local search al…
cs.AI2024★ 1 cited
ParLS-PBO: A Parallel Local Search Solver for Pseudo Boolean Optimization
Zhihan Chen, Peng Lin, Hao Hu +1
As a broadly applied technique in numerous optimization problems, recently, local search has been employed to solve Pseudo-Boolean Optimization (PBO) problem. A representative loca…
math.OC2023
New Characterizations and Efficient Local Search for General Integer Linear Programming
Peng Lin, Shaowei Cai, Mengchuan Zou +1
Integer linear programming (ILP) models a wide range of practical combinatorial optimization problems and significantly impacts industry and management sectors. This work proposes…