Group Qaplib

Group Description
Linear programming, lower bounds for quadratic assignment problem, M. Resende.

In the paper "Computing lower bounds for the quadratic assignment problem
with an interior point algorithm for linear programming," (Resende,
Ramakrishnan, and Drezner, O.R. 43 (781-791) 1995), compute an LP-based lower 
bound for the QAP using a interior point algorithm on numerous 
problems from the QAPLIB.  These linear programs are very difficult 
for direct factorization based LP solvers.

See http://www.research.att.com/~mgcr/ for more information.
The above paper is at http://www.research.att.com/~mgcr/doc/qaplp.ps. 

--------------------------------------------------------------------------------

See ../LPnetlib/README.txt for a description of the *.clu files.
Displaying all 8 collection matrices
Id Name Group Rows Cols Nonzeros Kind Date Download File
793 lp_nug05 Qaplib 210 225 1,050 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
794 lp_nug06 Qaplib 372 486 2,232 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
795 lp_nug07 Qaplib 602 931 4,214 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
796 lp_nug08 Qaplib 912 1,632 7,296 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
797 lp_nug12 Qaplib 3,192 8,856 38,304 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
798 lp_nug15 Qaplib 6,330 22,275 94,950 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
799 lp_nug20 Qaplib 15,240 72,600 304,800 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market
800 lp_nug30 Qaplib 52,260 379,350 1,567,800 Linear Programming Problem 1995 MATLAB Rutherford Boeing Matrix Market