Algorithms for the robust 1-center problem on a tree
AbstractNo abstract is available for this item.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 123 (2000)
Issue (Month): 2 (June)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Lu, Chung-Cheng, 2013. "Robust weighted vertex p-center model considering uncertain data: An application to emergency management," European Journal of Operational Research, Elsevier, vol. 230(1), pages 113-121.
- Conde, Eduardo, 2007. "Minmax regret location-allocation problem on a network under uncertainty," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1025-1039, June.
- Jurij Mihelič & Borut Robič, 2010. "Flexible-attribute problems," Computational Optimization and Applications, Springer, vol. 47(3), pages 553-566, November.
- Berman, Oded & Wang, Jiamin, 2011. "The minmax regret gradual covering location problem on a network with incomplete information of demand weights," European Journal of Operational Research, Elsevier, vol. 208(3), pages 233-238, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.