This is a web site to post certain instances from the paper A Parallel, Linear Programming Based Heuristic for Large Scale Set Partitioning Problems, by J. T. Linderoth, E. K. Lee, and M. W. P. Savelsbergh, that appeared in INFORMS Journal on Computing, 13 (2001), pp. 191-209.
Jeff is posting these here as a public service, and the information here is based on his notes taken at the time and his best recollections five years after he actually worked with the instances. Thus, he can’t really guarantee to be very helpful in answering any questions you have about the instances. But feel free to ask…
Happy MIP Solving!
The pairings are broken in 9 files. The files consist of lines whose first entry is the cost of the pairing, and the remaining (integer) entries are the row indices of the flight les that pairing covers. There are 342 rows and 12618766 columns in the IP. The LP relaxation has value zlp = 637.246540. The best known solution is 1108.86.
There are 190 rows and 8122371 columns in the IP formulation. The initial LP value is 940.649322 and the Optimal solution is 1078.
This instance comes from an Inventory Routing Application, and is given in MPS format…
These instances compe from capacitated vehicle routing. They are the set of routes I obtained after running a “few” rounds of a branch-and-price approach to solving the initial linear programming relaxation, with some extra routes just thrown in…