Inverse single facility location problem on a tree with balancing on the distance of server to clients

DOI10.3934/jimo.2021017zbMath1499.90116OpenAlexW3115877664MaRDI QIDQ2076390

Shahede Omidi, Jafar Fathali

Publication date: 16 February 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021017

zbMATH Keywords

balanced allocationequality measureinverse facility locationvariable edge length

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items

The reverse selective balance center location problem on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Looking for edge-equitable spanning trees
• Inverse 1-median problem on trees under weighted Hamming distance
• The discrete facility location problem with balanced allocation of customers
• The inverse 1-median problem on a cycle
• Optimal location with equitable loads
• Inverse 1-center location problems with edge length augmentation on trees
• Equity measurement in facility location analysis: A review and framework
• On computing a longest path in a tree
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• \(k\)-balanced center location problem: a new multi-objective facility location problem
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• A linear time algorithm for balance vertices on trees
• Equality measures properties for location problems
• Inverse and reverse balanced facility location problems with variable edge lengths on trees
• Effectiveness-equity models for facility location problems on tree networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Balanced location on a graph
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions