Fast bounding procedures for large instances of the simple plant location problem

Management Science

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Fast bounding procedures for large instances of the simple plant location problem. / Letchford, A N; Miller, Sebastian John.
In: Computers and Operations Research, Vol. 39, No. 5, 05.2012, p. 985-990.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Letchford, AN & Miller, SJ 2012, 'Fast bounding procedures for large instances of the simple plant location problem', Computers and Operations Research, vol. 39, no. 5, pp. 985-990. https://doi.org/10.1016/j.cor.2011.06.014

APA

Letchford, A. N., & Miller, S. J. (2012). Fast bounding procedures for large instances of the simple plant location problem. Computers and Operations Research, 39(5), 985-990. https://doi.org/10.1016/j.cor.2011.06.014

Vancouver

Letchford AN, Miller SJ. Fast bounding procedures for large instances of the simple plant location problem. Computers and Operations Research. 2012 May;39(5):985-990. doi: 10.1016/j.cor.2011.06.014

Author

Letchford, A N ; Miller, Sebastian John. / Fast bounding procedures for large instances of the simple plant location problem. In: Computers and Operations Research. 2012 ; Vol. 39, No. 5. pp. 985-990.

Bibtex

@article{71abdafe57cf4b4686e80d676439dd5b,

title = "Fast bounding procedures for large instances of the simple plant location problem",

abstract = "Some new, simple and extremely fast bounding procedures are presented for large-scale instances of the Simple Plant Location Problem. The lower-bounding procedures are based on dual ascent. The fastest of them runs in O(mn log m) time, where m and n are the number of locations and clients, respectively. The upper-bounding procedures are based on iteratively dropping facilities, and the fastest of them runs in O(m(n + log m)) time. Extensive computational results show that, in practice, the procedures give very good bounds extremely quickly.",

keywords = "Combinatorial optimistion, Facility location, Dual ascent",

author = "Letchford, {A N} and Miller, {Sebastian John}",

year = "2012",

month = may,

doi = "10.1016/j.cor.2011.06.014",

language = "English",

volume = "39",

pages = "985--990",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "5",

}

RIS

TY - JOUR

T1 - Fast bounding procedures for large instances of the simple plant location problem

AU - Letchford, A N

AU - Miller, Sebastian John

PY - 2012/5

Y1 - 2012/5

N2 - Some new, simple and extremely fast bounding procedures are presented for large-scale instances of the Simple Plant Location Problem. The lower-bounding procedures are based on dual ascent. The fastest of them runs in O(mn log m) time, where m and n are the number of locations and clients, respectively. The upper-bounding procedures are based on iteratively dropping facilities, and the fastest of them runs in O(m(n + log m)) time. Extensive computational results show that, in practice, the procedures give very good bounds extremely quickly.

AB - Some new, simple and extremely fast bounding procedures are presented for large-scale instances of the Simple Plant Location Problem. The lower-bounding procedures are based on dual ascent. The fastest of them runs in O(mn log m) time, where m and n are the number of locations and clients, respectively. The upper-bounding procedures are based on iteratively dropping facilities, and the fastest of them runs in O(m(n + log m)) time. Extensive computational results show that, in practice, the procedures give very good bounds extremely quickly.

KW - Combinatorial optimistion

KW - Facility location

KW - Dual ascent

U2 - 10.1016/j.cor.2011.06.014

DO - 10.1016/j.cor.2011.06.014

M3 - Journal article

VL - 39

SP - 985

EP - 990

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 5

ER -

Research

Electronic data

Links

Text available via DOI:

Keywords