On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks

DOI10.1007/s00186-018-0632-6zbMath1406.90071OpenAlexW2791184589MaRDI QIDQ1616830

Nguyen Thanh Hung, Kien Trung Nguyen, Huong Nguyen-Thu

Publication date: 7 November 2018

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-018-0632-6

zbMATH Keywords

treecomplexityconvexordered medianinverse location

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

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 ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse quickest center location problem on a tree ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse group 1-median problem on trees ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse eccentric vertex problem 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
• An inverse approach to convex ordered median problems in trees
• 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 median location problems with variable coordinates
• The inverse 1-median problem on a cycle
• Inverse 1-center location problems with edge length augmentation on trees
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• The inverse 1-center problem on cycles with variable edge lengths
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• The complexity analysis of the inverse center location problem
• Algorithmic results for ordered median problems
• Inverse combinatorial optimization: a survey on problems, methods, and results
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory

This page was built for publication: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks