Home > Research > Publications & Outputs > An aggressive reduction scheme for the simple p...

Links

Text available via DOI:

View graph of relations

An aggressive reduction scheme for the simple plant location problem

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

An aggressive reduction scheme for the simple plant location problem. / Letchford, Adam; Miller, Sebastian.
In: European Journal of Operational Research, Vol. 234, No. 3, 01.05.2014, p. 674-682.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Letchford, A & Miller, S 2014, 'An aggressive reduction scheme for the simple plant location problem', European Journal of Operational Research, vol. 234, no. 3, pp. 674-682. https://doi.org/10.1016/j.ejor.2013.10.020

APA

Letchford, A., & Miller, S. (2014). An aggressive reduction scheme for the simple plant location problem. European Journal of Operational Research, 234(3), 674-682. https://doi.org/10.1016/j.ejor.2013.10.020

Vancouver

Letchford A, Miller S. An aggressive reduction scheme for the simple plant location problem. European Journal of Operational Research. 2014 May 1;234(3):674-682. Epub 2013 Oct 18. doi: 10.1016/j.ejor.2013.10.020

Author

Letchford, Adam ; Miller, Sebastian. / An aggressive reduction scheme for the simple plant location problem. In: European Journal of Operational Research. 2014 ; Vol. 234, No. 3. pp. 674-682.

Bibtex

@article{ded0945d7a7a41d78fd272ee35cad52d,
title = "An aggressive reduction scheme for the simple plant location problem",
abstract = "Pisinger et al. introduced the concept of 'aggressive reduction' for large-scale combinatorial optimisation problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme for the 'Simple Plant Location Problem', which is a classical problem arising in logistics. The scheme involves four different reduction rules, along with lower- and upper-bounding procedures. The scheme turns out to be particularly effective for instances in which the facilities and clients correspond to points on the Euclidean plane.",
keywords = "Facility location, Combinatorial optimisation, integer programming",
author = "Adam Letchford and Sebastian Miller",
note = "The final, definitive version of this article has been published in the Journal, European Journal of Operational Research 234 (3), 2014, {\textcopyright} ELSEVIER.",
year = "2014",
month = may,
day = "1",
doi = "10.1016/j.ejor.2013.10.020",
language = "English",
volume = "234",
pages = "674--682",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier Science B.V.",
number = "3",

}

RIS

TY - JOUR

T1 - An aggressive reduction scheme for the simple plant location problem

AU - Letchford, Adam

AU - Miller, Sebastian

N1 - The final, definitive version of this article has been published in the Journal, European Journal of Operational Research 234 (3), 2014, © ELSEVIER.

PY - 2014/5/1

Y1 - 2014/5/1

N2 - Pisinger et al. introduced the concept of 'aggressive reduction' for large-scale combinatorial optimisation problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme for the 'Simple Plant Location Problem', which is a classical problem arising in logistics. The scheme involves four different reduction rules, along with lower- and upper-bounding procedures. The scheme turns out to be particularly effective for instances in which the facilities and clients correspond to points on the Euclidean plane.

AB - Pisinger et al. introduced the concept of 'aggressive reduction' for large-scale combinatorial optimisation problems. The idea is to spend much time and effort in reducing the size of the instance, in the hope that the reduced instance will then be small enough to be solved by an exact algorithm. We present an aggressive reduction scheme for the 'Simple Plant Location Problem', which is a classical problem arising in logistics. The scheme involves four different reduction rules, along with lower- and upper-bounding procedures. The scheme turns out to be particularly effective for instances in which the facilities and clients correspond to points on the Euclidean plane.

KW - Facility location

KW - Combinatorial optimisation

KW - integer programming

U2 - 10.1016/j.ejor.2013.10.020

DO - 10.1016/j.ejor.2013.10.020

M3 - Journal article

VL - 234

SP - 674

EP - 682

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -