Inverse quickest center location problem on a tree
type: Item
instance of: scholarly article
title: Inverse quickest center location problem on a tree
zbMATH Open document ID: 1409.05056
author: Iman Keshtkar
author: Mehdi Ghiyasvand
published in: Discrete Applied Mathematics
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 7051000
zbMATH Keywords: location problems
zbMATH Keywords: inverse center-location problem
zbMATH Keywords: quickest-path problem
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
MaRDI profile type: Publication
full work available at URL: j.dam.2019.01.001
OpenAlex ID: W2913310433
cites work: Q3056948
cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
cites work: A linear time algorithm for inverse obnoxious center location problems on networks
cites work: Inverse 1-center location problems with edge length augmentation on trees
cites work: Linear time optimal approaches for reverse obnoxious center location problems on networks
cites work: Inverse \(p\)-median problems with variable edge lengths
cites work: A note on the robust 1-center problem on trees
cites work: A polynomial method for the pos/neg weighted 3-median problem on a tree
cites work: The \(p\)-maxian problem on a tree
cites work: The inverse Fermat-Weber problem
cites work: Median problems with positive and negative weights on cycles and cacti
cites work: Inverse median problems
cites work: The inverse 1-median problem on a cycle
cites work: The complexity analysis of the inverse center location problem
cites work: Algorithms for the quickest path problem and the reliable quickest path problem
cites work: The quickest path problem
cites work: Reverse selective obnoxious center location problems on tree graphs
cites work: The inverse 1-maxian problem with edge length modification
cites work: An inverse approach to convex ordered median problems in trees
cites work: Inverse 1-median problem on trees under weighted Hamming distance
cites work: Q4532026
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: Distributed algorithms for the quickest path problem
cites work: Q4203976
cites work: An algorithm for the quickest path problem
cites work: Reverse 1-center problem on weighted trees
cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights
cites work: Inverse eccentric vertex problem on networks
cites work: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
cites work: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
cites work: A label-setting algorithm for finding a quickest path
cites work: Algorithms for the quickest path problem and the enumeration of quickest paths
cites work: Inverse center location problem on a tree
DOI: 10.1016/J.DAM.2019.01.001
Recommended article: Inverse center location problem on a tree
Recommended article: Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
Recommended article: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
Recommended article: Inverse 1-center location problems with edge length augmentation on trees
Recommended article: Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Recommended article: Inverse \(k\)-centrum problem on trees with variable vertex weights
Recommended article: Reverse 1-center problem on weighted trees
Recommended article: Reverse selective obnoxious center location problems on tree graphs
Recommended article: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Recommended article: Optimal algorithms for selective variants of the classical and inverse median location problems on trees
description: scientific article; zbMATH DE number 7051000