Inverse vertex/absolute quickest 1-center location problem on a tree under weighted l₁ norm

DOI10.1007/S10957-023-02362-6MaRDI QIDQ6191111zbMATH OpenOpenAlexFDO

Authors Xinqiang Qian, Xiucui Guan, Junhua Jia, Panos M. Pardalos

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

zbMATH Keywords

\(l_1\) normcenter locationinverse optimizationquickest 1-center problemtree

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• Inverse quickest center location problem on a tree
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites work

• A linear time algorithm for inverse obnoxious center location problems on networks
• An algorithm for the quickest path problem
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Introduction to actuarial and financial mathematical methods
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse center location problem on a tree
• Inverse median problems
• Inverse quickest center location problem on a tree
• 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
• Solving the absolute 1-center problem in the quickest path case
• The complexity analysis of the inverse center location problem
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• The quickest path problem
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm

Cited in

(2)

• The inverse center subtree problem on tree graphs
• The absolute quickest 1-center problem on a cycle and its reverse problem

This page was built for publication: Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm

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