Download Linnk AI
•
Autonomous Research Assistant
>
Sign In
insight
-
Optimization Problems
Lower Bounds on Complexity of Mixed-Integer Programs for Stable Set and Knapsack
Proving optimal complexity bounds for stable set and knapsack problems in MIP formulations.
1