Inverse median problems

DOI10.1016/J.DISOPT.2004.03.003zbMATH Open1087.90038OpenAlexW2050773466MaRDI QIDQ2386211FDOQ2386211

Authors: Carmen Pleschiutschnig, Rainer E. Burkard, Jianzhong Zhang 

Publication date: 22 August 2005

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.003

Recommendations

• Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
• Inverse median location problems with variable coordinates
• Inverse 1-median problem on trees under weighted Hamming distance
• The inverse 1-median problem on a tree and on a path
• Inverse \(p\)-median problems with variable edge lengths

zbMATH Keywords

\(p\)-MedianGreedy algorithmInverse optimizationLocation problem1-Median

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inverse problems in optimal control (49N45) Discrete location and assignment (90B80)

Cites Work

• The complexity analysis of the inverse center location problem
• Title not available (Why is that?)
• On an instance of the inverse shortest paths problem
• Improving the location of minimax facilities through network modification
• Title not available (Why is that?)
• Some reverse location problems
• Improving the location of minisum facilities through network modification

Cited In (81)

• 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
• Discrete optimization: an Austrian view
• 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
• 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
• Inverse eccentric vertex problem 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
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• 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
• Reverse 1-maxian problem with keeping existing 1-median
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• 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
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• 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
• Inverse 1-center location problems with edge length augmentation on trees
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• Resource allocation in rooted trees for VLSI applications
• 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 chromatic number problems in interval and permutation graphs
• Inverse median location problems with variable coordinates
• Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
• A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm
• The inverse 1-maxian problem with edge length modification
• The inverse Fermat-Weber problem
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Upgrading \(p\)-median problem on a path
• Reverse 2-median problem on trees
• Up- and downgrading the 1-center in a network
• A linear time algorithm for the \(p\)-maxian problem on trees with distance 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
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• The inverse 1-median problem on a tree and on a path
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• On some inverse 1-center location problems
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• The reversal median problem
• 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
• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• Mathematical models for the variable weights version of the inverse minimax circle location problem
• A hybrid algorithm for the uncertain inverse \(p\)-median location problem
• The minmax regret inverse maximum weight problem
• Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• Some robust inverse median problems on trees with interval costs
• 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
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
• Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
• The reverse selective balance center location problem on trees
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• 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
• The continuous knapsack problem with capacities
• The max-sum inverse median location problem on trees with budget constraint
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
• Inverse single facility location problem on a tree with balancing on the distance of server to clients
• Title not available (Why is that?)
• Robust reverse 1-center problems on trees with interval costs
• 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

This page was built for publication: Inverse median problems

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