Lower bounds on the complexity of mixed-integer programs for stable set and knapsack.
Saved in:
| Title: | Lower bounds on the complexity of mixed-integer programs for stable set and knapsack. |
|---|---|
| Authors: | Schade, Jamico1, jamico.schade@tum.de, Sinha, Makrand2, msinha@illinois.edu, Weltge, Stefan1, weltge@tum.de |
| Source: | Mathematical Programming; Mar2026, Vol. 216 Issue 1/2, p135-176, 42p |
| Database: | Applied Science & Technology Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
Be the first to leave a comment!
