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 (AUTHOR) jamico.schade@tum.de, Sinha, Makrand2 (AUTHOR) msinha@illinois.edu, Weltge, Stefan1 (AUTHOR) weltge@tum.de |
| Source: | Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p135-176. 42p. |
| Database: | Business Source Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 00255610 |
|---|---|
| DOI: | 10.1007/s10107-025-02234-z |