Author:
Bhattacharya Binay,Kameda Tsunehiko,Song Zhao
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Averbakh, I.: Complexity of robust single-facility location problems on networks with uncertain lengths of edges. Disc. Appl. Math. 127, 505–522 (2003)
2. Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Location Science 5, 247–254 (1997)
3. Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research 123(2), 292–302 (2000)
4. Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theoretical Compter Science 378(3), 237–252 (2007)
5. Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. thesis, School of Computing Science, Simon Fraser University, Canada (2004)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献