Discrete Optimization: Mixed Integer Program
Mixed Integer Program is a big field. Essentially a mixed integer program is a linear program with m constraints but some of the n variables are integers. The difference between having integer variables or not having integer variable is big. That’s the gap between being polynomial (P) and NP-complete. Having integers is what makes problems … Continue reading Discrete Optimization: Mixed Integer Program
Copy and paste this URL into your WordPress site to embed
Copy and paste this code into your site to embed