text: 🔍 Combinatorial Optimization (CO) problems require finding the optimal subset of objects from a finite set. Most CO problems are NP-hard, making exact solutions (e.g., via MIP) infeasible as set instances become larger. 🧵[2/n]