Pages that link to "Item:Q2460632"
From MaRDI portal
The following pages link to Computing the integer programming gap (Q2460632):
Displaying 11 items.
- Testing additive integrality gaps (Q378120) (← links)
- Compressed polytopes and statistical disclosure limitation (Q875709) (← links)
- The slice algorithm for irreducible decomposition of monomial ideals (Q1008570) (← links)
- Integer programming, Barvinok's counting algorithm and Gomory relaxations. (Q1417591) (← links)
- On the lattice programming gap of the group problems (Q1785637) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Inverse integer optimization with multiple observations (Q2039063) (← links)
- Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Sequential importance sampling for multiway tables (Q2493562) (← links)
- The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides (Q5080676) (← links)
