library for polynomially constrained
mixed-integer programming

polip :: contents / contributors / instances / archive / bibliography

Hard  HeKu_1991_30dept_set1

Problem typequadratic_linear_ordering
Descriptionsingle-row facility layout problem modeled as a quadratic linear ordering problem
Objective sensemin
Variables436  (435 binary, 0 general integer, 1 continuous)
Nonlinear variables1
Nonlinear constraints1
Linear nonzeros24360
Nonlinear nonzeros8640
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 solutionHeKu_1991_30dept_set1.sol.gz
Best known objective44965
Best known bound44965
FormulatorUlrike Pagacz
Donatortaken from FLP Database | University of Waterloo
References HeraguKusiak1988 AnjosVannelli2008
Links FLP Database | University of Waterloo
Additional informationAn instance of the single-row facility layout problem is formally defined by n one-dimensional facilities with given positive lengths and pairwise non-negative weights. The objective is to arrange the facilities so as to minimize the total weighted sum of the center-to-center distances between all pairs of facilities. This problem can be modeled as a quadratic objective over linear ordering variables.

© by maintainers  |     |  imprint