Pages that link to "Item:Q3565243"
From MaRDI portal
The following pages link to Integer Programming and Algorithmic Geometry of Numbers (Q3565243):
Displaying 9 items.
- Convex minization over \(\mathbb Z^2\) (Q631217) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Short Presburger Arithmetic Is Hard (Q5073520) (← links)
- The Computational Complexity of Integer Programming with Alternations (Q5108263) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Optimal divisions of a convex body (Q6180063) (← links)
