library for polynomially constrained
mixed-integer programming

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

Hard  Am_2009_33dept_set1

Problem typequadratic_linear_ordering
Descriptionsingle-row facility layout problem modeled as a quadratic linear ordering problem
Objective sensemin
Variables530  (528 binary, 0 general integer, 2 continuous)
Nonlinear variables2
Nonlinear constraints1
Linear nonzeros32736
Nonlinear nonzeros11717
Download Am_2009_33dept_set1.pip.gz Am_2009_33dept_set1.gms.gz Am_2009_33dept_set1.mod.gz Am_2009_33dept_set1.zpl.gz
Best known solutionAm_2009_33dept_set1.sol.gz
Best known objective60704.5
Best known bound60704.5
FormulatorUlrike Pagacz
Donatortaken from FLP Database | University of Waterloo
References Amaral2009
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