The inverse 1-median problem on a cycle

DOI10.1016/J.DISOPT.2006.11.008MaRDI QIDQ951097zbMATH OpenOpenAlexFDO

Authors Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang

Publication date 29 October 2008

Published in Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

inverse optimizationlocation problem1-medianspecial linear program

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Continuous location (90B85)

Recommendations

• The reverse 1-median problem on a cycle under the Hamming distance
• A linear time algorithm for the reverse 1‐median problem on a cycle
• The inverse 1-median problem on a tree and on a path
• Median problems with positive and negative weights on cycles and cacti
• Inverse median problems
• The reversal median problem
• Inverse p-median problems with variable edge lengths
• The inverse 1-center problem on cycles with variable edge lengths
• Inverse group 1-median problem on trees
• Inverse 1-median problem on block graphs with variable vertex weights

Cites work

• A linear time algorithm for the reverse 1‐median problem on a cycle
• Improving the location of minisum facilities through network modification
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• On an instance of the inverse shortest paths problem
• Some reverse location problems
• The complexity analysis of the inverse center location problem

Cited in

(58)

• The inverse connected p-median problem on block graphs under various cost functions
• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
• Classical and inverse median location problems under uncertain environment
• Inverse anti-k-centrum problem on networks with variable edge lengths
• 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
• The inverse 1-median problem on tree networks with variable real edge lengths
• Inverse 1-median problem on block graphs with variable vertex weights
• Unified approach to the inverse median location problem under the sum and the max objectives applying ordered median function
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse quickest center location problem on a tree
• 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
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse p-median problems with variable edge lengths
• Reverse 1-maxian problem with keeping existing 1-median
• 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
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
• Inverse 1-center location problems with edge length augmentation on trees
• The reverse 1-median problem on a cycle under the Hamming distance
• 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
• Some robust inverse median problems on trees with interval costs
• A linear time algorithm for the reverse 1‐median problem on a cycle
• Median problems with positive and negative weights on cycles and cacti
• 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
• Stability radius and an upgrading model of median location on trees
• The inverse center subtree problem on tree graphs
• 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
• 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
• The max-sum inverse median location problem on trees with budget constraint
• A model for the inverse 1-Median problem on trees under uncertain costs
• The inverse 1-center problem on cycles with variable edge lengths
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
• Budget-constrained inverse median facility location problem on tree networks
• Inverse single facility location problem on a tree with balancing on the distance of server to clients
• scientific article; zbMATH DE number 7709522 (Why is no real title available?)
• 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
• 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
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• The reversal median problem
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

This page was built for publication: The inverse 1-median problem on a cycle

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