2 papers
math.OC2026
When MILP Beats QP: Piecewise-Linear Reformulations of Sequentially Coupled Bilinear Programs
Quentin Ploussard, Maris Usis, Oluwabunmi Iwakin +1
The presence of bilinear terms in mathematical modeling generally yields nonconvex quadratic programs (QPs) that remain computationally challenging to solve to global optimality. W…
math.OC2025
Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
Quentin Ploussard, Xiang Li, Matija Pavičević
This paper addresses the problem of tightening the mixed-integer linear programming (MILP) formulation for continuous piecewise linear (CPWL) approximations of data sets in arbitra…