Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/6678
Title: | Primal-dual variable neighborhood search for the simple plant-location problem |
Authors: | Hansen, P Brimberg, J Urosevic, D Mladenović, N |
Keywords: | Metaheuristics;Variable-neighborhood search;Primal-dual methods;Branch and bound;Simple plant-location problem |
Issue Date: | 2007 |
Publisher: | INFORMS |
Citation: | INFORMS Journal on Computing, 19(4): 552 - 564, Sep 2007 |
Abstract: | The variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15, 000. |
Description: | Copyright @ 2007 INFORMS |
URI: | http://joc.journal.informs.org/content/19/4/552.short http://bura.brunel.ac.uk/handle/2438/6678 |
DOI: | http://dx.doi.org/10.1287/ijoc.1060.0196 |
ISSN: | 1091-9856 |
Appears in Collections: | Publications Computer Science Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 161.56 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.