 
Name  HeKu_1991_30dept_set1 
Classification  ncbcd2 
Problem type  quadratic_linear_ordering 
Description  singlerow facility layout problem modeled as a quadratic linear ordering problem 
 
Objective sense  min 
Variables  436 (435 binary, 0 general integer, 1 continuous) 
Nonlinear variables  1 
Constraints  8120 
Nonlinear constraints  1 
Linear nonzeros  24360 
Nonlinear nonzeros  8640 
 
Download  HeKu_1991_30dept_set1.pip.gz HeKu_1991_30dept_set1.gms.gz HeKu_1991_30dept_set1.mod.gz HeKu_1991_30dept_set1.zpl.gz 
Best known solution  HeKu_1991_30dept_set1.sol.gz 
Best known objective  44965 
Best known bound  44965 
 
Originator  
Formulator  Ulrike Pagacz 
Donator  taken from FLP Database  University of Waterloo 
 
References 
HeraguKusiak1988
AnjosVannelli2008

Links 
FLP Database  University of Waterloo 
 
Additional information  An instance of the singlerow facility layout problem is formally
defined by n onedimensional facilities with given positive lengths
and pairwise nonnegative weights. The objective is to arrange the
facilities so as to minimize the total weighted sum of the
centertocenter distances between all pairs of facilities. This
problem can be modeled as a quadratic objective over linear ordering
variables.

 