Inverse k-centrum problem on trees with variable vertex weights

DOI10.1007/S00186-015-0502-4zbMATH Open1330.90120OpenAlexW851766736MaRDI QIDQ494693FDOQ494693

Authors: 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

Recommendations

• An inverse approach to convex ordered median problems in trees
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Inverse center location problem on a tree
• The inverse 1-median problem on a tree and on a path
• Inverse \(p\)-median problems with variable edge lengths

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)

Cites Work

• Title not available (Why is that?)
• Location theory. A unified approach
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Inverse median problems
• The inverse 1-median problem on a tree and on a path
• Inverse eccentric vertex problem on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• 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
• The inverse 1-median problem on a cycle
• Inverse median location problems with variable coordinates
• The inverse Fermat-Weber problem
• Algorithmic results for ordered median problems

Cited In (31)

• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• Solving the absolute 1-center problem in the quickest path case
• Inverse group 1-median problem on trees
• Inverse quickest center location problem on a tree
• 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 \(p\)-median problems with variable edge lengths
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• Some robust inverse median problems on trees with interval costs
• Title not available (Why is that?)
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance
• Inverse center location problem on a tree
• The complexity analysis of the inverse center location problem
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Multi-depot traveling salesmen location problems on networks with special structure
• The max-sum inverse median location problem on trees with budget constraint
• 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
• The inverse 1-center problem on cycles with variable edge lengths
• Minimizing the expense transmission time from the source node to demand nodes
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• The inverse 1-median problem on a tree and on a path
• On some inverse 1-center location problems
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
• 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

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

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