The following pages link to (Q3352842):
Displaying 9 items.
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Test sets for integer programs (Q1365062) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
- Parameterized resiliency problems (Q2330129) (← links)
- Enumerating Projections of Integer Points in Unbounded Polyhedra (Q4638995) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- (Q5155665) (← links)