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

DOI10.7494/OPMATH.2016.36.4.513zbMATH Open1338.90086OpenAlexW2330761506MaRDI QIDQ2809658FDOQ2809658

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

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

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)

Cites Work

• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• The inverse 1-median problem on a tree and on a path
• Inverse eccentric vertex problem on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithm for Large Zero-One Knapsack Problems
• 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
• The inverse 1-median problem on a cycle
• Shortest path problem with uncertain arc lengths
• Reverse 1-center problem on weighted trees

Cited In (19)

• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Classical and inverse median location problems under uncertain environment
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• 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
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• An inverse approach to convex ordered median problems in trees
• The minmax regret inverse maximum weight problem
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• Some robust inverse median problems on trees with interval costs
• 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
• The continuous knapsack problem with capacities
• The inverse 1-center problem on cycles with variable edge lengths
• Title not available (Why is that?)
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• 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

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)