Data for: Optimal mathematical programming for the warehouse location problem with Euclidean distance linearization

Published: 11 Jul 2019 | Version 1 | DOI: 10.17632/46kw4zxxnw.1
Contributor(s):

Description of this data

Problem instances for the warehouse location problem, optimal solutions for small-sized instances, and source code for WLP by AMPL.

Experiment data files

This data is associated with the following publication:

Optimal mathematical programming for the warehouse location problem with Euclidean distance linearization

Published in: Computers & Industrial Engineering

Latest version

  • Version 1

    2019-07-11

    Published: 2019-07-11

    DOI: 10.17632/46kw4zxxnw.1

    Cite this dataset

    Xiao, Yiyong (2019), “Data for: Optimal mathematical programming for the warehouse location problem with Euclidean distance linearization”, Mendeley Data, v1 http://dx.doi.org/10.17632/46kw4zxxnw.1

Statistics

Views: 656
Downloads: 33

Categories

Clustering, Facility Location

Licence

CC BY NC 3.0 Learn more

The files associated with this dataset are licensed under a Attribution-NonCommercial 3.0 Unported licence.

What does this mean?

You are free to adapt, copy or redistribute the material, providing you attribute appropriately and do not use the material for commercial purposes.

Report