We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Fast bounding procedures for large instances of...
View graph of relations

« Back

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

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>05/2012
<mark>Journal</mark>Computers and Operations Research
Number of pages6
<mark>Original language</mark>English


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.