Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
From MaRDI portal
Publication:6191111
DOI10.1007/s10957-023-02362-6OpenAlexW4390858743MaRDI QIDQ6191111
Xiucui Guan, Panos M. Pardalos, Xinqiang Qian, Junhua Jia
Publication date: 9 February 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02362-6
Cites Work
- Unnamed Item
- Inverse 1-median problem on block graphs with variable vertex weights
- A linear time algorithm for inverse obnoxious center location problems on networks
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- 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 center location problem on a tree
- The quickest path problem
- The inverse 1-maxian problem with edge length modification
- An algorithm for the quickest path problem
- Inverse quickest center location problem on a tree
- The complexity analysis of the inverse center location problem
- Solving the absolute 1-center problem in the quickest path case
- Inverse median problems
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- On some inverse 1-center location problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
This page was built for publication: Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
