Inverse obnoxious p-median location problems on trees with edge length modifications under different norms

DOI10.1016/J.TCS.2018.11.020MaRDI QIDQ2632017zbMATH OpenOpenAlexWikidataFDO

Authors Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi

Publication date 17 May 2019

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2018.11.020

zbMATH Keywords

combinatorial optimizationinverse optimizationtime complexitytree networksobnoxious \(p\)-median location

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
• Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A linear time algorithm for inverse obnoxious center location problems on networks
• A model for the inverse 1-Median problem on trees under uncertain costs
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Combinatorial optimization. Theory and algorithms.
• Faster shortest-path algorithms for planar graphs
• Foundations of location analysis
• Introduction to algorithms
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse 1-median problem on trees under weighted Hamming distance
• Inverse p-median problems with variable edge lengths
• Inverse center location problem on a tree
• Inverse median location problems with variable coordinates
• Inverse median problems
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• The p-maxian problem on a tree
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse 1-median problem on a tree and on a path
• The inverse Fermat-Weber problem
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees

Cited in

(17)

• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• The inverse 1-median problem on tree networks with variable real edge lengths
• A linear time algorithm for inverse obnoxious center location problems on networks
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Expanding maximum capacity path under weighted sum-type distances
• 2-median location improvement problems under weighted \(l_1\) norm and \(l_\infty\) norm on trees
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
• Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation
• Optimal algorithms for some inverse uncapacitated facility location problems on networks
• The max-sum inverse median location problem on trees with budget constraint
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• 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
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

This page was built for publication: Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms

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