Linear time optimal approaches for reverse obnoxious center location problems on networks. (1st November 2016)

• Record Type: Journal Article
• Authors: Alizadeh, Behrooz; Etemad, Roghayeh
• Is Part Of: Optimization. Volume 65:Number 11(2016)
• Page Start: 2025
• Page End: 2036
• Publication Date: 2016-11-01
• Subjects: Obnoxious center location -- reverse optimization -- combinatorial optimization -- time complexity; 90B80 -- 90B85 -- 90C27 -- 90C35; Mathematical optimization -- Periodicals; 519.7
• DOI: 10.1080/02331934.2016.1203915
• Languages: English
• ISSNs: 0233-1934

Abstract

Abstract : This paper is concerned with a reverse obnoxious (undesirable) center location problem on networks in which the aim is to modify the edge lengths within an associated budget such that a predetermined facility location on the underlying network becomes as far as possible from the existing customer points under the new edge lengths. Exact combinatorial algorithms with linear time complexities are developed for the problem under the weighted rectilinear norm and the weighted Hamming distance. Furthermore, it is shown that the problem with integer decision variables can also be solved in linear time.