Browsing by Subject "NP – complete"
Now showing items 1-1 of 1
(North-West University (South Africa). Mahikeng Campus, 2019)The general binary linear programming (BLP) problem is known to be NP Complete. The lecture presents a new approach of transforming any BLP into a convex quadratic programming (CQP) problem. It is known that the CQPs can ...