Inverse \(k\)-centrum problem on trees with variable vertex weights

DOI10.1007/s00186-015-0502-4zbMath1330.90120OpenAlexW851766736MaRDI QIDQ494693

Kien Trung Nguyen, Lam Quoc Anh

Publication date: 2 September 2015

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

Full work available at URL: https://doi.org/10.1007/s00186-015-0502-4

zbMATH Keywords

treeinverse problemcenter problemordered median function\(k\)-centrum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (22)

Solving the absolute 1-center problem in the quickest path case ⋮ On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ 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 ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Multi-depot traveling salesmen location problems on networks with special structure ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Inverse quickest center location problem on a tree ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Inverse group 1-median problem on trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse eccentric vertex problem on networks
• An inverse approach to convex ordered median problems in trees
• 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
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Algorithmic results for ordered median problems
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians

This page was built for publication: Inverse \(k\)-centrum problem on trees with variable vertex weights