Linear time optimal approaches for reverse obnoxious center location problems on networks

DOI10.1080/02331934.2016.1203915zbMATH Open1351.90111OpenAlexW2462371941MaRDI QIDQ2836087FDOQ2836087

Authors: Behrooz Alizadeh, Roghayeh Etemad 

Publication date: 7 December 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2016.1203915

Recommendations

• A linear time algorithm for inverse obnoxious center location problems on networks
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Reverse selective obnoxious center location problems on tree graphs
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• scientific article; zbMATH DE number 1932373
• Approximation strategy-proof mechanisms for obnoxious facility location on a line
• The obnoxious \(p\) facility network location problem with facility interaction
• scientific article; zbMATH DE number 1696648
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks

zbMATH Keywords

combinatorial optimizationtime complexityobnoxious center locationreverse optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Continuous location (90B85)

Cites Work

• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Inverse median problems
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse eccentric vertex problem on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• The inverse 1-median problem on a cycle
• Discrete facility location and routing of obnoxious activities.
• Analytical models for locating undesirable facilities
• Inverse Optimization
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• Reverse 1-center problem on weighted trees
• Improving the location of minimax facilities through network modification
• Some reverse location problems
• Reverse 2-median problem on trees
• Improving the location of minisum facilities through network modification
• A linear time algorithm for the reverse 1‐median problem on a cycle

Cited In (19)

• Title not available (Why is that?)
• Inverse quickest center location problem on a tree
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
• A linear time algorithm for inverse obnoxious center location problems on networks
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Reverse 1-maxian problem with keeping existing 1-median
• Upgrading edges in the maximal covering location problem
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
• Reverse selective obnoxious center location problems on tree graphs
• Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• Optimal algorithms for some inverse uncapacitated facility location problems on networks
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• A new algorithm for the undesirable 1-center problem on networks

This page was built for publication: Linear time optimal approaches for reverse obnoxious center location problems on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836087)