Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

DOI10.1016/j.tcs.2019.05.039OpenAlexW2954331041WikidataQ127566788 ScholiaQ127566788MaRDI QIDQ2330101

van Huy Pham, Kien Trung Nguyen

Publication date: 18 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.05.039

zbMATH Keywords

treesknapsackinverse optimizationmedian problemChebyshev

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (7)

Solving the absolute 1-center problem in the quickest path case ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• 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
• 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
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse 1-center location problems with edge length augmentation on trees
• On an instance of the inverse shortest paths problem
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• The inverse 1-center problem on cycles with variable edge lengths
• Inverse quickest center location problem on a tree
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An Algorithm for Large Zero-One Knapsack Problems
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees

This page was built for publication: Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms