Below are some integer programming instances, with an original version, and a simple reformulation, using basis reduction, provided.
A striking feature of the instances is that the reformulated instances are much easier to solve for commercial IP solvers.
Instances for the paper
Column Basis Reduction and Decomposable Knapsack Problems,
B. Krishnamoorthy and G. Pataki, Discrete Optimization, 6(3), August 2009, 242-270
- Instances for the paper
Basis Reduction and the Complexity of Branch-and-Bound,
G. Pataki, M. Tural, E. B. Wong, 2010 ACM-SIAM Symposium on Discrete Algorithms (SODA 10)