HeKu_1991_20dept_set1
POLIPlibrary for polynomially constrained
| ||
HeKu_1991_20dept_set1| Name | HeKu_1991_20dept_set1 |
| Classification | nc|bc|d2 |
| Problem type | quadratic_linear_ordering |
| Description | single-row facility layout problem modeled as a quadratic linear ordering problem |
| Objective sense | min |
| Variables | 191 (190 binary, 0 general integer, 1 continuous) |
| Nonlinear variables | 1 |
| Constraints | 2280 |
| Nonlinear constraints | 1 |
| Linear nonzeros | 6840 |
| Nonlinear nonzeros | 2729 |
| Download | HeKu_1991_20dept_set1.pip.gz HeKu_1991_20dept_set1.gms.gz HeKu_1991_20dept_set1.mod.gz HeKu_1991_20dept_set1.zpl.gz |
| Best known solution | HeKu_1991_20dept_set1.sol.gz |
| Best known objective | 15549 |
| Best known bound | 15549 |
| Originator | |
| Formulator | Ulrike Pagacz |
| Donator | taken from FLP Database | University of Waterloo |
| References | HeraguKusiak1988 AnjosVannelli2008 |
| Links |
|
| Additional information | An 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