Some polynomially solvable cases of the inverse ordered 1-median problem on trees

DOI10.2298/FIL1712651NzbMath1488.90018MaRDI QIDQ5162023

Kien Trung Nguyen

Publication date: 1 November 2021

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

tree; complexity; location problem; inverse optimization; ordered median function

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance, On some inverse 1-center location problems, Inverse anti-\(k\)-centrum problem on networks with variable edge lengths, Inverse group 1-median problem on trees, Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• Foundations of location analysis
• 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 combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Reverse 1-center problem on weighted trees
• 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
• Location Theory
• 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
• The \(k\)-centrum multi-facility location problem