Pages that link to "Item:Q5053070"
From MaRDI portal
The following pages link to Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints (Q5053070):
Displaying 10 items.
- Lower bounds on the sizes of integer programs without additional variables (Q896270) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Integer programming in parameterized complexity: five miniatures (Q2673236) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Asymptotic behavior of Markov complexity (Q6199053) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- Markov Bases: A 25 Year Update (Q6567960) (← links)