Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks

DOI10.1007/s40314-023-02451-2MaRDI QIDQ6080433

Esmaeil Afrashteh, Behrooz Alizadeh, Sepideh Mohammadi

Publication date: 2 October 2023

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationtime complexityinverse optimizationobnoxious median location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• 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
• Inverse median location problems with variable coordinates
• Foundations of location analysis
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev 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
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees

This page was built for publication: Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks