%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/Mittelmann/nug08-3rd
% name: Mittelmann/nug08-3rd
% [LP lower bounds for quadratic assignment problems]
% id: 1645
% date: 1995
% author: S. Karisch, F. Rendl
% ed: H. Mittelmann
% fields: name title id kind date author ed A b aux notes
% aux: c lo hi z0
% kind: linear programming problem
%-------------------------------------------------------------------------------
% notes:
% Hans Mittelmann test set, http://plato.asu.edu/ftp/lptestset           
% minimize c'*x, subject to A*x=b and lo <= x <= hi                      
%                                                                        
% NUG:  computing LP lower bounds for quadratic assignment problems.  see
% S.E. KARISCH and F. RENDL. Lower bounds for the quadratic assignment   
% problem via triangle decompositions.  Mathematical Programming,        
% 71(2):137-152, 1995.                                                   
% K.G. Ramakrishnan, M.G.C. Resende, B. Ramachandran, and J.F. Pekny,    
% "Tight QAP bounds via linear programming," Combinatorial and Global    
% Optimization, P.M. Pardalos, A. Migdalas, and R.E. Burkard, eds.,      
% World Scientific Publishing Co., Singapore, pp. 297-303, 2002.         
%-------------------------------------------------------------------------------
