Inverse p-median problems with variable edge lengths

DOI10.1007/S00186-011-0346-5zbMATH Open1216.49032OpenAlexW2032381527MaRDI QIDQ532535FDOQ532535

Authors: F. Baroughi Bonab, Rainer E. Burkard, Elisabeth Gassner 

Publication date: 5 May 2011

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-011-0346-5

Recommendations

• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• The inverse 1-median problem on tree networks with variable real edge lengths
• The inverse 1-maxian problem with edge length modification
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Inverse median problems

zbMATH Keywords

complexity analysisinverse optimizationlocation problem\(p\)-median

Mathematics Subject Classification ID

Applications of graph theory (05C90) Inverse problems in optimal control (49N45)

Cites Work

• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Title not available (Why is that?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Linear Programming in Linear Time When the Dimension Is Fixed
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Inverse median problems
• An inverse approach to convex ordered median problems in trees
• The inverse 1-median problem on a cycle
• Inverse median location problems with variable coordinates
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• The inverse Fermat-Weber problem
• On an instance of the inverse shortest paths problem
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Computing the 2‐median on tree networks in O(n lg n) time
• Algorithms – ESA 2005

Cited In (54)

• Some robust inverse median problems on trees with interval costs
• Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
• The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Classical and inverse median location problems under uncertain environment
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• Reverse 1-center problem on weighted trees
• 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
• Inverse group 1-median problem on trees
• The inverse 1-median problem on tree networks with variable real edge lengths
• Inverse quickest center location problem on a tree
• Inverse 1-median problem on block graphs with variable vertex weights
• A linear time algorithm for inverse obnoxious center location problems 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
• A hybrid algorithm for the uncertain inverse \(p\)-median location problem
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Upgrading edges in the maximal covering location problem
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• The inverse 1-median problem on a cycle
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
• Inverse median location problems with variable coordinates
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
• 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 inverse 1-maxian problem with edge length modification
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Algorithms for location problems based on angular distances
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• Upgrading \(p\)-median problem on a path
• A modified particle swarm optimization algorithm for general inverse ordered \(p\)-median location problem on networks
• Optimal algorithms for some inverse uncapacitated facility location problems on networks
• Inverse median problems
• The max-sum inverse median location problem on trees with budget constraint
• The inverse 1-center problem on cycles with variable edge lengths
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• A fast algorithm for the rectilinear distance location problem
• Title not available (Why is that?)
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• On some inverse 1-center location problems
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• Inverse and reverse balanced facility location problems with variable edge lengths on trees
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

This page was built for publication: Inverse \(p\)-median problems with variable edge lengths

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