A model for the inverse 1-median problem on trees under uncertain costs

DOI10.7494/OpMath.2016.36.4.513zbMath1338.90086OpenAlexW2330761506MaRDI QIDQ2809658

Kien Trung Nguyen, Nguyen Thi Linh Chi

Publication date: 30 May 2016

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2016.36.4.513

zbMATH Keywords

treelocation probleminverse optimization problemuncertain variable

Mathematics Subject Classification ID

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

Related Items

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Classical and inverse median location problems under uncertain environment ⋮ The minmax regret inverse maximum weight problem ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ The continuous knapsack problem with capacities ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees

Cites Work

• Unnamed Item
• Inverse eccentric vertex problem on networks
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Shortest path problem with uncertain arc lengths
• The inverse 1-median problem on a cycle
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Reverse 1-center problem on weighted trees
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithm for Large Zero-One Knapsack Problems