Inverse quickest center location problem on a tree

DOI10.1016/j.dam.2019.01.001zbMath1409.05056OpenAlexW2913310433MaRDI QIDQ1741512

Iman Keshtkar, Mehdi Ghiyasvand

Publication date: 3 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.001

zbMATH Keywords

location problemsinverse center-location problemquickest-path problem

Mathematics Subject Classification ID

Trees (05C05)

Related Items (9)

Solving the absolute 1-center problem in the quickest path case ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Inverse group 1-median problem on trees ⋮ Inverse integer optimization with multiple observations ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse eccentric vertex problem on networks
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Algorithms for the quickest path problem and the reliable quickest path problem
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Inverse \(p\)-median problems with variable edge lengths
• Median problems with positive and negative weights on cycles and cacti
• Inverse center location problem on a tree
• The quickest path problem
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• Inverse 1-center location problems with edge length augmentation on trees
• Algorithms for the quickest path problem and the enumeration of quickest paths
• Distributed algorithms for the quickest path problem
• An algorithm for the quickest path problem
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• Reverse selective obnoxious center location problems on tree graphs
• The complexity analysis of the inverse center location problem
• A note on the robust 1-center problem on trees
• A label-setting algorithm for finding a quickest path
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• The \(p\)-maxian problem on a tree
• Reverse 1-center problem on weighted trees
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees

This page was built for publication: Inverse quickest center location problem on a tree