The inverse 1-center problem on cycles with variable edge lengths

DOI10.1007/S10100-017-0509-4zbMath1464.90084OpenAlexW2769586190MaRDI QIDQ1725838

Kien Trung Nguyen

Publication date: 15 February 2019

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-017-0509-4

zbMATH Keywords

cycleconvexparameterizationinverse optimization1-center problem

Mathematics Subject Classification ID

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

Related Items (10)

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 ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ 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 max-sum inverse median location problem on trees with budget constraint ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse group 1-median problem on trees ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• A linear time algorithm for inverse obnoxious center location problems on networks
• 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 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
• The inverse 1-median problem on a cycle
• Inverse 1-center location problems with edge length augmentation on trees
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse median problems
• A model for the inverse 1-median problem on trees under uncertain costs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

This page was built for publication: The inverse 1-center problem on cycles with variable edge lengths