The reverse selective balance center location problem on trees
From MaRDI portal
Publication:6191728
DOI10.1007/s12597-023-00706-4MaRDI QIDQ6191728
Nguyen Thanh Toan, Kien Trung Nguyen, Huy Minh Le
Publication date: 11 March 2024
Published in: Opsearch (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
90B80: Discrete location and assignment
90Bxx: Operations research and management science
Cites Work
- Unnamed Item
- An effective heuristic for the \(P\)-median problem with application to ambulance location
- Inverse median location problems with variable coordinates
- The discrete facility location problem with balanced allocation of customers
- Improving the location of minisum facilities through network modification
- Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
- Optimal location with equitable loads
- Reverse selective obnoxious center location problems on tree graphs
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Reverse 1-maxian problem with keeping existing 1-median
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- Inverse median problems
- A linear time algorithm for balance vertices on trees
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- The balanced 2-median and 2-maxian problems on a tree
- Reverse 1-center problem on weighted trees
- Improving the location of minimax facilities through network modification
- Balanced location on a graph
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- Further Study on Reverse 1-Center Problem on Trees
- Minimum cuts in near-linear time
- Reverse 1-centre problem on trees under convex piecewise-linear cost function