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

Letchford, A N and Miller, Sebastian John (2012) Fast bounding procedures for large instances of the simple plant location problem. Computers and Operations Research, 39 (5). pp. 985-990. ISSN 0305-0548

[img]
Preview
PDF (Fast bounding procedures for large instances of the simple plant location problem)
10.pdf - Submitted Version

Download (136kB)

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.

Item Type:
Journal Article
Journal or Publication Title:
Computers and Operations Research
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
45838
Deposited By:
Deposited On:
11 Jul 2011 18:38
Refereed?:
Yes
Published?:
Published
Last Modified:
12 Jul 2020 03:34