Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems

DOI10.1142/S0217595918500306zbMath1404.90088OpenAlexW2808194524WikidataQ129705338 ScholiaQ129705338MaRDI QIDQ4689388

Behrooz Alizadeh, Fahimeh Baroughi, Esmaeil Afrashteh, Kien Trung Nguyen

Publication date: 16 October 2018

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595918500306

zbMATH Keywords

combinatorial optimizationmedian location problemtime complexityinverse optimization

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ 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

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• 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
• Inverse eccentric vertex problem on networks
• 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
• 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
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• Reverse 2-median problem on trees
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• Some reverse location problems
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse median problems
• Reverse 1-center problem on weighted trees
• A model for the inverse 1-median problem on trees under uncertain costs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Location Theory
• An Algorithm for Large Zero-One Knapsack Problems
• Improving the location of minimax facilities through network modification
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• A linear time algorithm for the reverse 1‐median problem on a cycle

This page was built for publication: Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems