HiGHS high-performance open-source LP/QP/MIP optimization suite
From MaRDI portal
Cited in
(5)- linear programming (lp) problems with linear objective and linear constraints
- interior-point method for lp using barrier-based primal-dual iterations
- quadratic programming (qp) problems with quadratic objective and linear constraints (convex or indefinite)
- branch-and-bound systematic enumeration with bounds for integer/mixed-integer programs
- mixed-integer programming (mip) problems combining integer and continuous variables
This page was built for software: HiGHS high-performance open-source LP/QP/MIP optimization suite
