Five dense MinLA instances with n in {12, 15, 17, 23, 30}

Published: 15 Jun 2019 | Version 1 | DOI: 10.17632/n5f3zcdg92.1
Contributor(s):

Description of this data

These are five dense MinLA problem instances with n in {12, 15, 17, 23, 30}.
They were introduced in:
Amaral, A. R. S. A (2009) Mixed 0-1 linear programming formulation
for the exact solution of the minimum linear arrangement problem.
Optimization Letters, 3(4): 513-520.
https://doi.org/10.1007/s11590-009-0130-0

Experiment data files

Latest version

  • Version 1

    2019-06-15

    Published: 2019-06-15

    DOI: 10.17632/n5f3zcdg92.1

    Cite this dataset

    Amaral, Andre (2019), “Five dense MinLA instances with n in {12, 15, 17, 23, 30}”, Mendeley Data, v1 http://dx.doi.org/10.17632/n5f3zcdg92.1

Statistics

Views: 10
Downloads: 2

Categories

Facility Layout

Licence

CC BY 4.0 Learn more

The files associated with this dataset are licensed under a Creative Commons Attribution 4.0 International licence.

What does this mean?
You can share, copy and modify this dataset so long as you give appropriate credit, provide a link to the CC BY license, and indicate if changes were made, but you may not do so in a way that suggests the rights holder has endorsed you or your use of the dataset. Note that further permission may be required for any content within the dataset that is identified as belonging to a third party.

Report