Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

DOI10.1007/s40306-018-0286-8zbMath1425.90022OpenAlexW2889323634WikidataQ129321304 ScholiaQ129321304MaRDI QIDQ2337353

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

Publication date: 19 November 2019

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40306-018-0286-8

zbMATH Keywords

treelocation probleminverse optimization problem1-center problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (5)

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 cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Inverse group 1-median problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse eccentric vertex problem on networks
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• 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
• A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm
• 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
• Inverse median problems
• Reverse 1-center problem on weighted trees
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithm for Large Zero-One Knapsack Problems
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Pioneering Developments in Location Analysis

This page was built for publication: Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees