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

DOI10.1007/S40306-018-0286-8MaRDI QIDQ2337353zbMATH OpenOpenAlexWikidataFDO

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

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

1-center probleminverse optimization problemlocation problemtree

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse center location problems
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions

Cites work

• A combinatorial algorithm for the 1-median problem in R^d with the Chebyshev norm
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• An Algorithm for Large Zero-One Knapsack Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1746287 (Why is no real title available?)
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse 1-median problem on block graphs with variable vertex weights
• 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
• Inverse eccentric vertex problem on networks
• Inverse median location problems with variable coordinates
• Inverse median problems
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Pioneering Developments in Location Analysis
• Reverse 1-center problem on weighted trees
• The complexity analysis of the inverse center location problem
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• The inverse 1-median problem on a cycle
• The inverse 1-median problem on a tree and on a path
• The inverse Fermat-Weber problem
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees

Cited in

(24)

• Inverse 1-center location problems with edge length augmentation on trees
• Upgrading the 1-center problem with edge length variables on a tree
• Inverse quickest center location problem on a tree
• Center problems with pos/neg weights on trees
• A note on the robust 1-center problem on trees
• Inverse group 1-median problem on trees
• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• Computation of inverse 1-centre location problem on the weighted interval graphs
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• Reverse 1-center problem on weighted trees
• Inverse center location problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• scientific article; zbMATH DE number 5732600 (Why is no real title available?)
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Inverse eccentric vertex problem on trees
• Further study on reverse 1-center problem on trees
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
• Some robust inverse median problems on trees with interval costs
• The inverse center subtree problem on tree graphs
• The inverse connected p-median problem on block graphs under various cost functions

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

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