Lancaster EPrints

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) - Draft Version
Download (133Kb) | Preview

    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: Article
    Journal or Publication Title: Computers and Operations Research
    Uncontrolled Keywords: Combinatorial optimistion ; Facility location ; Dual ascent
    Subjects:
    Departments: Lancaster University Management School > Management Science
    ID Code: 45838
    Deposited By: ep_importer_pure
    Deposited On: 11 Jul 2011 19:38
    Refereed?: Yes
    Published?: Published
    Last Modified: 06 Feb 2013 16:55
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/45838

    Actions (login required)

    View Item