Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks

DOI10.1007/s10957-018-1334-1zbMath1410.90115OpenAlexW2809123786WikidataQ129627705 ScholiaQ129627705MaRDI QIDQ1730835

Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi

Publication date: 6 March 2019

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1334-1

zbMATH Keywords

combinatorial optimizationtime complexityinverse optimizationobnoxious median location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ On some inverse 1-center location problems ⋮ Inverse group 1-median problem on trees ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse 1-median problem on trees under weighted Hamming distance
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse median location problems with variable coordinates
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• Discrete facility location and routing of obnoxious activities.
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse median problems
• The \(p\)-maxian problem on a tree
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• A model for the inverse 1-median problem on trees under uncertain costs
• Vertices of given degree in series-parallel graphs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithm for Large Zero-One Knapsack Problems
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Combinatorial optimization. Theory and algorithms.
• Faster shortest-path algorithms for planar graphs

This page was built for publication: Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks