Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks

DOI10.1007/s40305-018-0229-zzbMath1474.90246OpenAlexW2901572591WikidataQ128944738 ScholiaQ128944738MaRDI QIDQ2033986

Fahimeh Baroughi, Esmaeil Afrashteh, Behrooz Alizadeh

Publication date: 18 June 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-018-0229-z

zbMATH Keywords

combinatorial optimizationtime complexityinverse optimizationundesirable \(p\)-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)

Related Items (4)

Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ An approximation algorithm for stochastic multi-level facility location problem with soft capacities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for inverse obnoxious center location problems on networks
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• The inverse 1-maxian problem with edge length modification
• Discrete facility location and routing of obnoxious activities.
• Some reverse location problems
• Reverse selective obnoxious center location problems on tree graphs
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

This page was built for publication: Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks