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

DOI10.7494/OPMATH.2016.36.4.513MaRDI QIDQ2809658zbMATH OpenOpenAlexFDO

Authors 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

inverse optimization problemlocation problemtreeuncertain variable

Mathematics Subject Classification ID

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

Recommendations

• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• Classical and inverse median location problems under uncertain environment
• Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• The inverse 1-median problem on a tree and on a path

Cites work

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

Cited in

(21)

• 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 continuous knapsack problem with capacities
• Computational aspects of the inverse single facility location problem on trees under l_k-norm
• The minmax regret inverse maximum weight problem
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• 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
• 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
• An inverse approach to convex ordered median problems in trees
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• scientific article; zbMATH DE number 6311584 (Why is no real title available?)
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• Some robust inverse median problems on trees with interval costs
• Unified approach to the inverse median location problem under the sum and the max objectives applying ordered median function
• Budget-constrained inverse median facility location problem on tree networks
• The inverse connected p-median problem on block graphs under various cost functions

This page was built for publication: A model for the inverse 1-Median problem on trees under uncertain costs

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