3 papers
math.OC2024
Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving
Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1
Cutting planes (cuts) are crucial for solving Mixed Integer Linear Programming (MILP) problems. Advanced MILP solvers typically rely on manually designed heuristic algorithms for c…
math.NA2020
Optimized Multivariate Polynomial Determinant on GPU
Jianjun Wei, Liangyu Chen
We present an optimized algorithm calculating determinant for multivariate polynomial matrix on GPU. The novel algorithm provides precise determinant for input multivariate polynom…
math.NA2018
An efficient algorithm for global interval solution of nonlinear algebraic equations and its GPGPU implementation
Dang Lin, Liangyu Chen
Solving nonlinear algebraic equations is a classic mathematics problem, and common in scientific researches and engineering applications. There are many numeric, symbolic and numer…